Base | Representation |
---|---|
bin | 101111100010110110… |
… | …0011111000110110111 |
3 | 100202112121002021101102 |
4 | 1133011230133012313 |
5 | 3133100330133421 |
6 | 114523215120315 |
7 | 10243105234325 |
oct | 1370554370667 |
9 | 322477067342 |
10 | 102101021111 |
11 | 3a334401391 |
12 | 1795551309b |
13 | 9821b972bb |
14 | 4d280d4d15 |
15 | 29c890460b |
hex | 17c5b1f1b7 |
102101021111 has 2 divisors, whose sum is σ = 102101021112. Its totient is φ = 102101021110.
The previous prime is 102101021083. The next prime is 102101021129. The reversal of 102101021111 is 111120101201.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 102101021111 - 222 = 102096826807 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 102101021092 and 102101021101.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (102101021161) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51050510555 + 51050510556.
It is an arithmetic number, because the mean of its divisors is an integer number (51050510556).
Almost surely, 2102101021111 is an apocalyptic number.
102101021111 is a deficient number, since it is larger than the sum of its proper divisors (1).
102101021111 is an equidigital number, since it uses as much as digits as its factorization.
102101021111 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 102101021111 its reverse (111120101201), we get a palindrome (213221122312).
The spelling of 102101021111 in words is "one hundred two billion, one hundred one million, twenty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •