Base | Representation |
---|---|
bin | 10111001100011100011111… |
… | …110000011010001101100111 |
3 | 111101012002102021100222122111 |
4 | 113030130133300122031213 |
5 | 101332314044031000041 |
6 | 1000542515122341451 |
7 | 30326000233025413 |
oct | 2714343760321547 |
9 | 441162367328574 |
10 | 102010301031271 |
11 | 2a55a364590246 |
12 | b5363434ba887 |
13 | 44bc6b7866a99 |
14 | 1b294797c5d43 |
15 | bbd7c6cbe981 |
hex | 5cc71fc1a367 |
102010301031271 has 2 divisors, whose sum is σ = 102010301031272. Its totient is φ = 102010301031270.
The previous prime is 102010301031169. The next prime is 102010301031293. The reversal of 102010301031271 is 172130103010201.
It is an a-pointer prime, because the next prime (102010301031293) can be obtained adding 102010301031271 to its sum of digits (22).
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 102010301031271 - 217 = 102010300900199 is a prime.
It is a super-2 number, since 2×1020103010312712 (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 (102010301032271) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51005150515635 + 51005150515636.
It is an arithmetic number, because the mean of its divisors is an integer number (51005150515636).
Almost surely, 2102010301031271 is an apocalyptic number.
102010301031271 is a deficient number, since it is larger than the sum of its proper divisors (1).
102010301031271 is an equidigital number, since it uses as much as digits as its factorization.
102010301031271 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 252, while the sum is 22.
Adding to 102010301031271 its reverse (172130103010201), we get a palindrome (274140404041472).
The spelling of 102010301031271 in words is "one hundred two trillion, ten billion, three hundred one million, thirty-one thousand, two hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •