Base | Representation |
---|---|
bin | 10111001100010011110110… |
… | …000010001011010000101001 |
3 | 111101011012102211202010201121 |
4 | 113030103312002023100221 |
5 | 101332141032321022303 |
6 | 1000534341223215241 |
7 | 30325221100015543 |
oct | 2714236602132051 |
9 | 441135384663647 |
10 | 102001011110953 |
11 | 2a55642767a649 |
12 | b5345902a7521 |
13 | 44bb867007906 |
14 | 1b28c37aa2693 |
15 | bbd4314259bd |
hex | 5cc4f608b429 |
102001011110953 has 2 divisors, whose sum is σ = 102001011110954. Its totient is φ = 102001011110952.
The previous prime is 102001011110927. The next prime is 102001011110959. The reversal of 102001011110953 is 359011110100201.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 66306934410649 + 35694076700304 = 8142907^2 + 5974452^2 .
It is a cyclic number.
It is not a de Polignac number, because 102001011110953 - 225 = 102000977556521 is a prime.
It is not a weakly prime, because it can be changed into another prime (102001011110959) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51000505555476 + 51000505555477.
It is an arithmetic number, because the mean of its divisors is an integer number (51000505555477).
Almost surely, 2102001011110953 is an apocalyptic number.
It is an amenable number.
102001011110953 is a deficient number, since it is larger than the sum of its proper divisors (1).
102001011110953 is an equidigital number, since it uses as much as digits as its factorization.
102001011110953 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 270, while the sum is 25.
The spelling of 102001011110953 in words is "one hundred two trillion, one billion, eleven million, one hundred ten thousand, nine hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •