Base | Representation |
---|---|
bin | 10111001111001101010110… |
… | …101011110001000110101111 |
3 | 111101212020120201220010120102 |
4 | 113033031112223301012233 |
5 | 101343422002441402343 |
6 | 1001210042500341315 |
7 | 30345502154124431 |
oct | 2717152653610657 |
9 | 441766521803512 |
10 | 102200201122223 |
11 | 2a6229531a8276 |
12 | b5671006a483b |
13 | 450458c5874c9 |
14 | 1b34732378651 |
15 | bc36dd6ed3b8 |
hex | 5cf356af11af |
102200201122223 has 2 divisors, whose sum is σ = 102200201122224. Its totient is φ = 102200201122222.
The previous prime is 102200201122177. The next prime is 102200201122247. The reversal of 102200201122223 is 322221102002201.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 102200201122223 - 216 = 102200201056687 is a prime.
It is a super-2 number, since 2×1022002011222232 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 102200201122195 and 102200201122204.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (102200201122423) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51100100561111 + 51100100561112.
It is an arithmetic number, because the mean of its divisors is an integer number (51100100561112).
Almost surely, 2102200201122223 is an apocalyptic number.
102200201122223 is a deficient number, since it is larger than the sum of its proper divisors (1).
102200201122223 is an equidigital number, since it uses as much as digits as its factorization.
102200201122223 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 384, while the sum is 20.
Adding to 102200201122223 its reverse (322221102002201), we get a palindrome (424421303124424).
The spelling of 102200201122223 in words is "one hundred two trillion, two hundred billion, two hundred one million, one hundred twenty-two thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •