Base | Representation |
---|---|
bin | 111011101110101… |
… | …101110011111100 |
3 | 2120211122001112100 |
4 | 323232231303330 |
5 | 4023014231022 |
6 | 243234305100 |
7 | 33555504132 |
oct | 7356556374 |
9 | 2524561470 |
10 | 1002102012 |
11 | 47472a08a |
12 | 23b728190 |
13 | 12c7c4b92 |
14 | 97137752 |
15 | 5ce991ac |
hex | 3bbadcfc |
1002102012 has 36 divisors (see below), whose sum is σ = 2534051520. Its totient is φ = 333907392.
The previous prime is 1002101999. The next prime is 1002102041. The reversal of 1002102012 is 2102012001.
It is a tau number, because it is divible by the number of its divisors (36).
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 1002101985 and 1002102003.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 187189 + ... + 192467.
It is an arithmetic number, because the mean of its divisors is an integer number (70390320).
Almost surely, 21002102012 is an apocalyptic number.
1002102012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1002102012 is an abundant number, since it is smaller than the sum of its proper divisors (1531949508).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1002102012 is a wasteful number, since it uses less digits than its factorization.
1002102012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10562 (or 10557 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
The square root of 1002102012 is about 31655.9948824863. The cubic root of 1002102012 is about 1000.7001802998.
Adding to 1002102012 its reverse (2102012001), we get a palindrome (3104114013).
The spelling of 1002102012 in words is "one billion, two million, one hundred two thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •