Base | Representation |
---|---|
bin | 111100011001011… |
… | …100001101101000 |
3 | 2121121201002012011 |
4 | 330121130031220 |
5 | 4033401131440 |
6 | 244314325304 |
7 | 34052632405 |
oct | 7431341550 |
9 | 2547632164 |
10 | 1013302120 |
11 | 47aa89976 |
12 | 243429834 |
13 | 131c16a6c |
14 | 988112ac |
15 | 5de5c9ea |
hex | 3c65c368 |
1013302120 has 32 divisors (see below), whose sum is σ = 2280960000. Its totient is φ = 405137728.
The previous prime is 1013302067. The next prime is 1013302141. The reversal of 1013302120 is 212033101.
1013302120 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a self number, because there is not a number n which added to its sum of digits gives 1013302120.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 115737 + ... + 124183.
It is an arithmetic number, because the mean of its divisors is an integer number (71280000).
Almost surely, 21013302120 is an apocalyptic number.
1013302120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1013302120 is an abundant number, since it is smaller than the sum of its proper divisors (1267657880).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1013302120 is a wasteful number, since it uses less digits than its factorization.
1013302120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11457 (or 11453 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 13.
The square root of 1013302120 is about 31832.4067578938. The cubic root of 1013302120 is about 1004.4145233072.
Adding to 1013302120 its reverse (212033101), we get a palindrome (1225335221).
The spelling of 1013302120 in words is "one billion, thirteen million, three hundred two thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •