Base | Representation |
---|---|
bin | 10111001100010011110111… |
… | …010001111100110001110001 |
3 | 111101011012111022002120212112 |
4 | 113030103313101330301301 |
5 | 101332141103144220103 |
6 | 1000534343251335105 |
7 | 30325221442534214 |
oct | 2714236721746161 |
9 | 441135438076775 |
10 | 102001032023153 |
11 | 2a55643846325a |
12 | b5345972b1495 |
13 | 44bb86b44a2b3 |
14 | 1b28c3a78777b |
15 | bbd4331a6cd8 |
hex | 5cc4f747cc71 |
102001032023153 has 2 divisors, whose sum is σ = 102001032023154. Its totient is φ = 102001032023152.
The previous prime is 102001032023089. The next prime is 102001032023167. The reversal of 102001032023153 is 351320230100201.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 60106636605409 + 41894395417744 = 7752847^2 + 6472588^2 .
It is a cyclic number.
It is not a de Polignac number, because 102001032023153 - 26 = 102001032023089 is a prime.
It is a super-2 number, since 2×1020010320231532 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (102001032023173) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51000516011576 + 51000516011577.
It is an arithmetic number, because the mean of its divisors is an integer number (51000516011577).
Almost surely, 2102001032023153 is an apocalyptic number.
It is an amenable number.
102001032023153 is a deficient number, since it is larger than the sum of its proper divisors (1).
102001032023153 is an equidigital number, since it uses as much as digits as its factorization.
102001032023153 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1080, while the sum is 23.
Adding to 102001032023153 its reverse (351320230100201), we get a palindrome (453321262123354).
The spelling of 102001032023153 in words is "one hundred two trillion, one billion, thirty-two million, twenty-three thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •