Base | Representation |
---|---|
bin | 10111000000111100101010… |
… | …110010101101001010111111 |
3 | 111021101120001121211210100212 |
4 | 113000330222302231022333 |
5 | 101231342443310401002 |
6 | 555135531252543035 |
7 | 30214630134541406 |
oct | 2700745262551277 |
9 | 437346047753325 |
10 | 101220212200127 |
11 | 2a285283a88399 |
12 | b4291a4321a7b |
13 | 4463043074987 |
14 | 1add12789c63d |
15 | ba7e83b90352 |
hex | 5c0f2acad2bf |
101220212200127 has 2 divisors, whose sum is σ = 101220212200128. Its totient is φ = 101220212200126.
The previous prime is 101220212200087. The next prime is 101220212200147. The reversal of 101220212200127 is 721002212022101.
It is a strong prime.
It is an emirp because it is prime and its reverse (721002212022101) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 101220212200127 - 212 = 101220212196031 is a prime.
It is a super-2 number, since 2×1012202122001272 (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 (101220212200147) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50610106100063 + 50610106100064.
It is an arithmetic number, because the mean of its divisors is an integer number (50610106100064).
Almost surely, 2101220212200127 is an apocalyptic number.
101220212200127 is a deficient number, since it is larger than the sum of its proper divisors (1).
101220212200127 is an equidigital number, since it uses as much as digits as its factorization.
101220212200127 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 448, while the sum is 23.
Adding to 101220212200127 its reverse (721002212022101), we get a palindrome (822222424222228).
The spelling of 101220212200127 in words is "one hundred one trillion, two hundred twenty billion, two hundred twelve million, two hundred thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •