Base | Representation |
---|---|
bin | 10111001101110000111110… |
… | …100011101101111101100001 |
3 | 111101111202120002021022001112 |
4 | 113031300332203231331201 |
5 | 101340310333100024301 |
6 | 1001052320223513105 |
7 | 30335361155341325 |
oct | 2715607643557541 |
9 | 441452502238045 |
10 | 102101012111201 |
11 | 2a5948836291a4 |
12 | b54ba3a458795 |
13 | 44c8112aa76cc |
14 | 1b2da02d03985 |
15 | bc0d357ab9bb |
hex | 5cdc3e8edf61 |
102101012111201 has 2 divisors, whose sum is σ = 102101012111202. Its totient is φ = 102101012111200.
The previous prime is 102101012111183. The next prime is 102101012111221. The reversal of 102101012111201 is 102111210101201.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 93203558331601 + 8897453779600 = 9654199^2 + 2982860^2 .
It is a cyclic number.
It is not a de Polignac number, because 102101012111201 - 226 = 102100945002337 is a prime.
It is a super-2 number, since 2×1021010121112012 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (102101012111221) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51050506055600 + 51050506055601.
It is an arithmetic number, because the mean of its divisors is an integer number (51050506055601).
Almost surely, 2102101012111201 is an apocalyptic number.
It is an amenable number.
102101012111201 is a deficient number, since it is larger than the sum of its proper divisors (1).
102101012111201 is an equidigital number, since it uses as much as digits as its factorization.
102101012111201 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 14.
Adding to 102101012111201 its reverse (102111210101201), we get a palindrome (204212222212402).
The spelling of 102101012111201 in words is "one hundred two trillion, one hundred one billion, twelve million, one hundred eleven thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •