Base | Representation |
---|---|
bin | 10111001101110001111010… |
… | …001001111111101011110011 |
3 | 111101111212010202201222000110 |
4 | 113031301322021333223303 |
5 | 101340314410033013021 |
6 | 1001053003342552403 |
7 | 30335425016303061 |
oct | 2715617211775363 |
9 | 441455122658013 |
10 | 102102012001011 |
11 | 2a595246a87210 |
12 | b550079298703 |
13 | 44c8241ca6699 |
14 | 1b2da99a23031 |
15 | bc0d9346a476 |
hex | 5cdc7a27faf3 |
102102012001011 has 32 divisors (see below), whose sum is σ = 150414661207296. Its totient is φ = 61090770320000.
The previous prime is 102102012000983. The next prime is 102102012001111. The reversal of 102102012001011 is 110100210201201.
It is a cyclic number.
It is not a de Polignac number, because 102102012001011 - 210 = 102102011999987 is a prime.
It is not an unprimeable number, because it can be changed into a prime (102102012001111) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 42984180 + ... + 45297281.
It is an arithmetic number, because the mean of its divisors is an integer number (4700458162728).
Almost surely, 2102102012001011 is an apocalyptic number.
102102012001011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
102102012001011 is a deficient number, since it is larger than the sum of its proper divisors (48312649206285).
102102012001011 is a wasteful number, since it uses less digits than its factorization.
102102012001011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 88281923.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 102102012001011 its reverse (110100210201201), we get a palindrome (212202222202212).
It can be divided in two parts, 1021020 and 12001011, that added together give a palindrome (13022031).
The spelling of 102102012001011 in words is "one hundred two trillion, one hundred two billion, twelve million, one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.102 sec. • engine limits •