Base | Representation |
---|---|
bin | 10110110010000111101010… |
… | …010000011000101010101111 |
3 | 111010210010212110102000211021 |
4 | 112302013222100120222233 |
5 | 101113144100341243041 |
6 | 553035450033035011 |
7 | 30051204460546315 |
oct | 2662075220305257 |
9 | 433703773360737 |
10 | 100201222212271 |
11 | 29a22110775564 |
12 | b2a38026b5a67 |
13 | 43bac1c73593b |
14 | 1aa5a9d3660b5 |
15 | b8b6e51bacd1 |
hex | 5b21ea418aaf |
100201222212271 has 2 divisors, whose sum is σ = 100201222212272. Its totient is φ = 100201222212270.
The previous prime is 100201222212209. The next prime is 100201222212281. The reversal of 100201222212271 is 172212222102001.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 100201222212271 - 221 = 100201220115119 is a prime.
It is a super-2 number, since 2×1002012222122712 (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 (100201222212281) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50100611106135 + 50100611106136.
It is an arithmetic number, because the mean of its divisors is an integer number (50100611106136).
Almost surely, 2100201222212271 is an apocalyptic number.
100201222212271 is a deficient number, since it is larger than the sum of its proper divisors (1).
100201222212271 is an equidigital number, since it uses as much as digits as its factorization.
100201222212271 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 896, while the sum is 25.
Adding to 100201222212271 its reverse (172212222102001), we get a palindrome (272413444314272).
The spelling of 100201222212271 in words is "one hundred trillion, two hundred one billion, two hundred twenty-two million, two hundred twelve thousand, two hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •