Base | Representation |
---|---|
bin | 10110110000101011011101… |
… | …010001101110010001000111 |
3 | 111010102200022211200021211111 |
4 | 112300223131101232101013 |
5 | 101110033321333230041 |
6 | 552522154120345451 |
7 | 30041101222456015 |
oct | 2660533521562107 |
9 | 433380284607744 |
10 | 100102220211271 |
11 | 29994127716923 |
12 | b288593015287 |
13 | 43b17a2912665 |
14 | 1aa0d8aa918b5 |
15 | b88d4d8b9981 |
hex | 5b0add46e447 |
100102220211271 has 2 divisors, whose sum is σ = 100102220211272. Its totient is φ = 100102220211270.
The previous prime is 100102220211263. The next prime is 100102220211293. The reversal of 100102220211271 is 172112022201001.
It is an a-pointer prime, because the next prime (100102220211293) can be obtained adding 100102220211271 to its sum of digits (22).
It is a weak prime.
It is an emirp because it is prime and its reverse (172112022201001) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 100102220211271 - 23 = 100102220211263 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (100102220211571) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50051110105635 + 50051110105636.
It is an arithmetic number, because the mean of its divisors is an integer number (50051110105636).
Almost surely, 2100102220211271 is an apocalyptic number.
100102220211271 is a deficient number, since it is larger than the sum of its proper divisors (1).
100102220211271 is an equidigital number, since it uses as much as digits as its factorization.
100102220211271 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 224, while the sum is 22.
Adding to 100102220211271 its reverse (172112022201001), we get a palindrome (272214242412272).
The spelling of 100102220211271 in words is "one hundred trillion, one hundred two billion, two hundred twenty million, two hundred eleven thousand, two hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •