Base | Representation |
---|---|
bin | 10111001101111001011100… |
… | …111101000101011101001111 |
3 | 111101112122001021100011100120 |
4 | 113031321130331011131033 |
5 | 101340433002133341421 |
6 | 1001100423214200023 |
7 | 30336132523252560 |
oct | 2715713475053517 |
9 | 441478037304316 |
10 | 102110112012111 |
11 | 2a598723253465 |
12 | b551759ab3013 |
13 | 44c8c33165368 |
14 | 1b302276c2167 |
15 | bc11b961d8c6 |
hex | 5cde5cf4574f |
102110112012111 has 64 divisors (see below), whose sum is σ = 165216205440000. Its totient is φ = 54760702519296.
The previous prime is 102110112012101. The next prime is 102110112012133. The reversal of 102110112012111 is 111210211011201.
It is not a de Polignac number, because 102110112012111 - 29 = 102110112011599 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102110112012101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 918622165 + ... + 918733313.
It is an arithmetic number, because the mean of its divisors is an integer number (2581503210000).
Almost surely, 2102110112012111 is an apocalyptic number.
102110112012111 is a deficient number, since it is larger than the sum of its proper divisors (63106093427889).
102110112012111 is a wasteful number, since it uses less digits than its factorization.
102110112012111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 118448.
The product of its (nonzero) digits is 8, while the sum is 15.
Adding to 102110112012111 its reverse (111210211011201), we get a palindrome (213320323023312).
The spelling of 102110112012111 in words is "one hundred two trillion, one hundred ten billion, one hundred twelve million, twelve thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •