Base | Representation |
---|---|
bin | 10111001100010011111011… |
… | …111111101001100111101011 |
3 | 111101011012200210220201121102 |
4 | 113030103323333221213223 |
5 | 101332141233421042141 |
6 | 1000534355154432015 |
7 | 30325223423014355 |
oct | 2714237377514753 |
9 | 441135623821542 |
10 | 102001111112171 |
11 | 2a556479071a87 |
12 | b5345b989260b |
13 | 44bb88194bb2b |
14 | 1b28c470940d5 |
15 | bbd43a0ca99b |
hex | 5cc4fbfe99eb |
102001111112171 has 2 divisors, whose sum is σ = 102001111112172. Its totient is φ = 102001111112170.
The previous prime is 102001111112107. The next prime is 102001111112177. The reversal of 102001111112171 is 171211111100201.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 102001111112171 - 26 = 102001111112107 is a prime.
It is not a weakly prime, because it can be changed into another prime (102001111112177) 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, 51000555556085 + 51000555556086.
It is an arithmetic number, because the mean of its divisors is an integer number (51000555556086).
Almost surely, 2102001111112171 is an apocalyptic number.
102001111112171 is a deficient number, since it is larger than the sum of its proper divisors (1).
102001111112171 is an equidigital number, since it uses as much as digits as its factorization.
102001111112171 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 28, while the sum is 20.
Adding to 102001111112171 its reverse (171211111100201), we get a palindrome (273212222212372).
The spelling of 102001111112171 in words is "one hundred two trillion, one billion, one hundred eleven million, one hundred twelve thousand, one hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •