Base | Representation |
---|---|
bin | 10111001101110000111111… |
… | …000010100101000010010111 |
3 | 111101111202120122111022022211 |
4 | 113031300333002211002113 |
5 | 101340310342132413421 |
6 | 1001052321113134251 |
7 | 30335361314164141 |
oct | 2715607702450227 |
9 | 441452518438284 |
10 | 102101020201111 |
11 | 2a594888154278 |
12 | b54ba410ba387 |
13 | 44c811467aa39 |
14 | 1b2da0400bc91 |
15 | bc0d363589e1 |
hex | 5cdc3f0a5097 |
102101020201111 has 2 divisors, whose sum is σ = 102101020201112. Its totient is φ = 102101020201110.
The previous prime is 102101020201097. The next prime is 102101020201129. The reversal of 102101020201111 is 111102020101201.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-102101020201111 is a prime.
It is a super-2 number, since 2×1021010202011112 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 102101020201091 and 102101020201100.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (102101020201711) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51050510100555 + 51050510100556.
It is an arithmetic number, because the mean of its divisors is an integer number (51050510100556).
Almost surely, 2102101020201111 is an apocalyptic number.
102101020201111 is a deficient number, since it is larger than the sum of its proper divisors (1).
102101020201111 is an equidigital number, since it uses as much as digits as its factorization.
102101020201111 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 102101020201111 its reverse (111102020101201), we get a palindrome (213203040302312).
The spelling of 102101020201111 in words is "one hundred two trillion, one hundred one billion, twenty million, two hundred one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •