Base | Representation |
---|---|
bin | 10111001100010011110111… |
… | …010001111100110010000101 |
3 | 111101011012111022002120220021 |
4 | 113030103313101330302011 |
5 | 101332141103144220143 |
6 | 1000534343251335141 |
7 | 30325221442534243 |
oct | 2714236721746205 |
9 | 441135438076807 |
10 | 102001032023173 |
11 | 2a556438463278 |
12 | b5345972b14b1 |
13 | 44bb86b44a2ca |
14 | 1b28c3a787793 |
15 | bbd4331a6ced |
hex | 5cc4f747cc85 |
102001032023173 has 2 divisors, whose sum is σ = 102001032023174. Its totient is φ = 102001032023172.
The previous prime is 102001032023171. The next prime is 102001032023239. The reversal of 102001032023173 is 371320230100201.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 53399819320324 + 48601212702849 = 7307518^2 + 6971457^2 .
It is a cyclic number.
It is not a de Polignac number, because 102001032023173 - 21 = 102001032023171 is a prime.
Together with 102001032023171, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (102001032023171) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51000516011586 + 51000516011587.
It is an arithmetic number, because the mean of its divisors is an integer number (51000516011587).
Almost surely, 2102001032023173 is an apocalyptic number.
It is an amenable number.
102001032023173 is a deficient number, since it is larger than the sum of its proper divisors (1).
102001032023173 is an equidigital number, since it uses as much as digits as its factorization.
102001032023173 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1512, while the sum is 25.
Adding to 102001032023173 its reverse (371320230100201), we get a palindrome (473321262123374).
The spelling of 102001032023173 in words is "one hundred two trillion, one billion, thirty-two million, twenty-three thousand, one hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •