Base | Representation |
---|---|
bin | 10111001111010110100110… |
… | …101011010010110101111111 |
3 | 111101220012012220200101122212 |
4 | 113033112212223102311333 |
5 | 101344102323034011033 |
6 | 1001214404213331035 |
7 | 30346303244462432 |
oct | 2717264653226577 |
9 | 441805186611585 |
10 | 102210133110143 |
11 | 2a62708a589853 |
12 | b569012936a7b |
13 | 45054b3150c36 |
14 | 1b34dd5475819 |
15 | bc3ac0624748 |
hex | 5cf5a6ad2d7f |
102210133110143 has 2 divisors, whose sum is σ = 102210133110144. Its totient is φ = 102210133110142.
The previous prime is 102210133110089. The next prime is 102210133110167. The reversal of 102210133110143 is 341011331012201.
It is a strong prime.
It is an emirp because it is prime and its reverse (341011331012201) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 102210133110143 - 220 = 102210132061567 is a prime.
It is a super-2 number, since 2×1022101331101432 (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 (102210133110443) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51105066555071 + 51105066555072.
It is an arithmetic number, because the mean of its divisors is an integer number (51105066555072).
Almost surely, 2102210133110143 is an apocalyptic number.
102210133110143 is a deficient number, since it is larger than the sum of its proper divisors (1).
102210133110143 is an equidigital number, since it uses as much as digits as its factorization.
102210133110143 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 432, while the sum is 23.
Adding to 102210133110143 its reverse (341011331012201), we get a palindrome (443221464122344).
The spelling of 102210133110143 in words is "one hundred two trillion, two hundred ten billion, one hundred thirty-three million, one hundred ten thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •