Base | Representation |
---|---|
bin | 10111001100010100111101… |
… | …000001011100100101011111 |
3 | 111101011022111211210202110020 |
4 | 113030110331001130211133 |
5 | 101332201002214231421 |
6 | 1000535055330243223 |
7 | 30325262441203143 |
oct | 2714247501344537 |
9 | 441138454722406 |
10 | 102002202102111 |
11 | 2a556988992963 |
12 | b534863126513 |
13 | 44bb9c69966cc |
14 | 1b28d0bd29223 |
15 | bbd4a0c81dc6 |
hex | 5cc53d05c95f |
102002202102111 has 4 divisors (see below), whose sum is σ = 136002936136152. Its totient is φ = 68001468068072.
The previous prime is 102002202102029. The next prime is 102002202102247. The reversal of 102002202102111 is 111201202200201.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 102002202102111 - 213 = 102002202093919 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102002252102111) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 17000367017016 + ... + 17000367017021.
It is an arithmetic number, because the mean of its divisors is an integer number (34000734034038).
Almost surely, 2102002202102111 is an apocalyptic number.
102002202102111 is a deficient number, since it is larger than the sum of its proper divisors (34000734034041).
102002202102111 is an equidigital number, since it uses as much as digits as its factorization.
102002202102111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34000734034040.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 102002202102111 its reverse (111201202200201), we get a palindrome (213203404302312).
The spelling of 102002202102111 in words is "one hundred two trillion, two billion, two hundred two million, one hundred two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •