Base | Representation |
---|---|
bin | 10111001101110000111101… |
… | …110101100110100000011001 |
3 | 111101111202112020112002211212 |
4 | 113031300331311212200121 |
5 | 101340310322001201131 |
6 | 1001052315112432505 |
7 | 30335360650521056 |
oct | 2715607565464031 |
9 | 441452466462755 |
10 | 102101000022041 |
11 | 2a594877821459 |
12 | b54ba363a8735 |
13 | 44c8110433c67 |
14 | 1b2da0147802d |
15 | bc0d346bea2b |
hex | 5cdc3dd66819 |
102101000022041 has 2 divisors, whose sum is σ = 102101000022042. Its totient is φ = 102101000022040.
The previous prime is 102101000021989. The next prime is 102101000022083. The reversal of 102101000022041 is 140220000101201.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 83705298883600 + 18395701138441 = 9149060^2 + 4289021^2 .
It is a cyclic number.
It is not a de Polignac number, because 102101000022041 - 242 = 97702953510937 is a prime.
It is a super-2 number, since 2×1021010000220412 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (102101000025041) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51050500011020 + 51050500011021.
It is an arithmetic number, because the mean of its divisors is an integer number (51050500011021).
Almost surely, 2102101000022041 is an apocalyptic number.
It is an amenable number.
102101000022041 is a deficient number, since it is larger than the sum of its proper divisors (1).
102101000022041 is an equidigital number, since it uses as much as digits as its factorization.
102101000022041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 102101000022041 its reverse (140220000101201), we get a palindrome (242321000123242).
The spelling of 102101000022041 in words is "one hundred two trillion, one hundred one billion, twenty-two thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •