Base | Representation |
---|---|
bin | 10111001101111011010100… |
… | …101101100100110001101011 |
3 | 111101112211020022000002110200 |
4 | 113031323110231210301223 |
5 | 101341001111012241021 |
6 | 1001101354430243243 |
7 | 30336233361212331 |
oct | 2715732455446153 |
9 | 441484208002420 |
10 | 102112121212011 |
11 | 2a599564404049 |
12 | b55201a956523 |
13 | 44c91934b1041 |
14 | 1b30378493b51 |
15 | bc1285bec126 |
hex | 5cded4b64c6b |
102112121212011 has 6 divisors (see below), whose sum is σ = 147495286195140. Its totient is φ = 68074747474668.
The previous prime is 102112121211983. The next prime is 102112121212033. The reversal of 102112121212011 is 110212121211201.
It is a happy number.
It is not a de Polignac number, because 102112121212011 - 210 = 102112121210987 is a prime.
It is a super-2 number, since 2×1021121212120112 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (102112121214011) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 5672895622881 + ... + 5672895622898.
It is an arithmetic number, because the mean of its divisors is an integer number (24582547699190).
Almost surely, 2102112121212011 is an apocalyptic number.
102112121212011 is a deficient number, since it is larger than the sum of its proper divisors (45383164983129).
102112121212011 is a wasteful number, since it uses less digits than its factorization.
102112121212011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11345791245785 (or 11345791245782 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 18.
Adding to 102112121212011 its reverse (110212121211201), we get a palindrome (212324242423212).
The spelling of 102112121212011 in words is "one hundred two trillion, one hundred twelve billion, one hundred twenty-one million, two hundred twelve thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •