Base | Representation |
---|---|
bin | 10111001100010100111101… |
… | …100011110011110001000101 |
3 | 111101011022112110202101220011 |
4 | 113030110331203303301011 |
5 | 101332201012021004312 |
6 | 1000535100251310221 |
7 | 30325262610601114 |
oct | 2714247543636105 |
9 | 441138473671804 |
10 | 102002211109957 |
11 | 2a556992a85664 |
12 | b53486614b371 |
13 | 44bb9c87cb7b2 |
14 | 1b28d0d1d1c7b |
15 | bbd4a1960da7 |
hex | 5cc53d8f3c45 |
102002211109957 has 2 divisors, whose sum is σ = 102002211109958. Its totient is φ = 102002211109956.
The previous prime is 102002211109927. The next prime is 102002211110003. The reversal of 102002211109957 is 759901112200201.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 97783599096481 + 4218612013476 = 9888559^2 + 2053926^2 .
It is a cyclic number.
It is not a de Polignac number, because 102002211109957 - 239 = 101452455296069 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (102002211109927) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51001105554978 + 51001105554979.
It is an arithmetic number, because the mean of its divisors is an integer number (51001105554979).
Almost surely, 2102002211109957 is an apocalyptic number.
It is an amenable number.
102002211109957 is a deficient number, since it is larger than the sum of its proper divisors (1).
102002211109957 is an equidigital number, since it uses as much as digits as its factorization.
102002211109957 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 22680, while the sum is 40.
The spelling of 102002211109957 in words is "one hundred two trillion, two billion, two hundred eleven million, one hundred nine thousand, nine hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •