Base | Representation |
---|---|
bin | 10110111101111010111100… |
… | …011010110000111101110111 |
3 | 111020122200011000221210100211 |
4 | 112331322330122300331313 |
5 | 101214440442203001442 |
6 | 554500210500250251 |
7 | 30163614350163106 |
oct | 2675727432607567 |
9 | 436580130853324 |
10 | 101012202000247 |
11 | 2a20504171249a |
12 | b3b4a120a0987 |
13 | 4449543380b75 |
14 | 1ad3033a1a03d |
15 | ba285c3a8617 |
hex | 5bdebc6b0f77 |
101012202000247 has 2 divisors, whose sum is σ = 101012202000248. Its totient is φ = 101012202000246.
The previous prime is 101012202000167. The next prime is 101012202000257. The reversal of 101012202000247 is 742000202210101.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-101012202000247 is a prime.
It is a super-2 number, since 2×1010122020002472 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101012202000257) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50506101000123 + 50506101000124.
It is an arithmetic number, because the mean of its divisors is an integer number (50506101000124).
Almost surely, 2101012202000247 is an apocalyptic number.
101012202000247 is a deficient number, since it is larger than the sum of its proper divisors (1).
101012202000247 is an equidigital number, since it uses as much as digits as its factorization.
101012202000247 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 448, while the sum is 22.
Adding to 101012202000247 its reverse (742000202210101), we get a palindrome (843012404210348).
The spelling of 101012202000247 in words is "one hundred one trillion, twelve billion, two hundred two million, two hundred forty-seven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •