Base | Representation |
---|---|
bin | 10111001101110010000101… |
… | …111101101100001111001111 |
3 | 111101111212122120111112210101 |
4 | 113031302011331230033033 |
5 | 101340320311241232343 |
6 | 1001053035140551531 |
7 | 30335432643161452 |
oct | 2715620575541717 |
9 | 441455576445711 |
10 | 102102210102223 |
11 | 2a595338892621 |
12 | b5501136b25a7 |
13 | 44c8274047636 |
14 | 1b2dab806d499 |
15 | bc0da5a4be4d |
hex | 5cdc85f6c3cf |
102102210102223 has 2 divisors, whose sum is σ = 102102210102224. Its totient is φ = 102102210102222.
The previous prime is 102102210102173. The next prime is 102102210102241. The reversal of 102102210102223 is 322201012201201.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 102102210102223 - 233 = 102093620167631 is a prime.
It is a super-2 number, since 2×1021022101022232 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 102102210102223.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (102102210102323) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51051105051111 + 51051105051112.
It is an arithmetic number, because the mean of its divisors is an integer number (51051105051112).
Almost surely, 2102102210102223 is an apocalyptic number.
102102210102223 is a deficient number, since it is larger than the sum of its proper divisors (1).
102102210102223 is an equidigital number, since it uses as much as digits as its factorization.
102102210102223 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 192, while the sum is 19.
Adding to 102102210102223 its reverse (322201012201201), we get a palindrome (424303222303424).
The spelling of 102102210102223 in words is "one hundred two trillion, one hundred two billion, two hundred ten million, one hundred two thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •