Base | Representation |
---|---|
bin | 10111001111010000000100… |
… | …001000110101101001001101 |
3 | 111101212112002112201110200002 |
4 | 113033100010020311221031 |
5 | 101343443432431420412 |
6 | 1001211243333414045 |
7 | 30345634241314235 |
oct | 2717200410655115 |
9 | 441775075643602 |
10 | 102203111201357 |
11 | 2a624106930851 |
12 | b56779319a325 |
13 | 4504934446b1a |
14 | 1b3492aa54cc5 |
15 | bc380de2ddc2 |
hex | 5cf404235a4d |
102203111201357 has 2 divisors, whose sum is σ = 102203111201358. Its totient is φ = 102203111201356.
The previous prime is 102203111201287. The next prime is 102203111201371. The reversal of 102203111201357 is 753102111302201.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 72981670070761 + 29221441130596 = 8542931^2 + 5405686^2 .
It is a cyclic number.
It is not a de Polignac number, because 102203111201357 - 212 = 102203111197261 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (102203111207357) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51101555600678 + 51101555600679.
It is an arithmetic number, because the mean of its divisors is an integer number (51101555600679).
Almost surely, 2102203111201357 is an apocalyptic number.
It is an amenable number.
102203111201357 is a deficient number, since it is larger than the sum of its proper divisors (1).
102203111201357 is an equidigital number, since it uses as much as digits as its factorization.
102203111201357 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2520, while the sum is 29.
Adding to 102203111201357 its reverse (753102111302201), we get a palindrome (855305222503558).
The spelling of 102203111201357 in words is "one hundred two trillion, two hundred three billion, one hundred eleven million, two hundred one thousand, three hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •