Base | Representation |
---|---|
bin | 10111001100010011110101… |
… | …011011101001011100111010 |
3 | 111101011012102010202000012100 |
4 | 113030103311123221130322 |
5 | 101332141022224323002 |
6 | 1000534340222524230 |
7 | 30325220615121612 |
oct | 2714236533513472 |
9 | 441135363660170 |
10 | 102001001011002 |
11 | 2a556421a01385 |
12 | b534588a36676 |
13 | 44bb864bac702 |
14 | 1b28c365d3a42 |
15 | bbd4305cd11c |
hex | 5cc4f56e973a |
102001001011002 has 96 divisors (see below), whose sum is σ = 222116717204928. Its totient is φ = 33829286819328.
The previous prime is 102001001010943. The next prime is 102001001011043. The reversal of 102001001011002 is 200110100100201.
It is a happy number.
It is a super-2 number, since 2×1020010010110022 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 10320849153 + ... + 10320859035.
It is an arithmetic number, because the mean of its divisors is an integer number (2313715804218).
Almost surely, 2102001001011002 is an apocalyptic number.
102001001011002 is an abundant number, since it is smaller than the sum of its proper divisors (120115716193926).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102001001011002 is a wasteful number, since it uses less digits than its factorization.
102001001011002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13164 (or 13161 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 102001001011002 its reverse (200110100100201), we get a palindrome (302111101111203).
The spelling of 102001001011002 in words is "one hundred two trillion, one billion, one million, eleven thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •