Base | Representation |
---|---|
bin | 10110101111010111101000… |
… | …010000110100010111011111 |
3 | 111010010001222212222110220202 |
4 | 112233113220100310113133 |
5 | 101102100001303212041 |
6 | 552412550341534115 |
7 | 30031433542210022 |
oct | 2657275020642737 |
9 | 433101885873822 |
10 | 100012210210271 |
11 | 29959a38394947 |
12 | b273052a1433b |
13 | 43a61599cb238 |
14 | 1a9a88c70d1b9 |
15 | b86831714a9b |
hex | 5af5e84345df |
100012210210271 has 2 divisors, whose sum is σ = 100012210210272. Its totient is φ = 100012210210270.
The previous prime is 100012210210223. The next prime is 100012210210273. The reversal of 100012210210271 is 172012012210001.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-100012210210271 is a prime.
It is a super-2 number, since 2×1000122102102712 (a number of 29 digits) contains 22 as substring.
Together with 100012210210273, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (100012210210273) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50006105105135 + 50006105105136.
It is an arithmetic number, because the mean of its divisors is an integer number (50006105105136).
Almost surely, 2100012210210271 is an apocalyptic number.
100012210210271 is a deficient number, since it is larger than the sum of its proper divisors (1).
100012210210271 is an equidigital number, since it uses as much as digits as its factorization.
100012210210271 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 112, while the sum is 20.
Adding to 100012210210271 its reverse (172012012210001), we get a palindrome (272024222420272).
The spelling of 100012210210271 in words is "one hundred trillion, twelve billion, two hundred ten million, two hundred ten thousand, two hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.107 sec. • engine limits •