Base | Representation |
---|---|
bin | 10111001100011110001100… |
… | …001111000111111000111011 |
3 | 111101012021010010000002120221 |
4 | 113030132030033013320323 |
5 | 101332331310440201021 |
6 | 1000543415455200511 |
7 | 30326063312503024 |
oct | 2714361417077073 |
9 | 441167103002527 |
10 | 102012121022011 |
11 | 2a560108959222 |
12 | b536770b16137 |
13 | 44bc917935c95 |
14 | 1b295ad3c3c4b |
15 | bbd881976241 |
hex | 5cc78c3c7e3b |
102012121022011 has 2 divisors, whose sum is σ = 102012121022012. Its totient is φ = 102012121022010.
The previous prime is 102012121022003. The next prime is 102012121022033. The reversal of 102012121022011 is 110220121210201.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 102012121022011 - 23 = 102012121022003 is a prime.
It is a super-2 number, since 2×1020121210220112 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (102012121022411) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51006060511005 + 51006060511006.
It is an arithmetic number, because the mean of its divisors is an integer number (51006060511006).
Almost surely, 2102012121022011 is an apocalyptic number.
102012121022011 is a deficient number, since it is larger than the sum of its proper divisors (1).
102012121022011 is an equidigital number, since it uses as much as digits as its factorization.
102012121022011 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 102012121022011 its reverse (110220121210201), we get a palindrome (212232242232212).
The spelling of 102012121022011 in words is "one hundred two trillion, twelve billion, one hundred twenty-one million, twenty-two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •