Base | Representation |
---|---|
bin | 101101111110011001101000… |
… | …010011001001010000110111 |
3 | 222111221011010000010102200101 |
4 | 231332121220103021100313 |
5 | 203000322022333211411 |
6 | 1554013255424254531 |
7 | 60406324644450115 |
oct | 5576315023112067 |
9 | 874834100112611 |
10 | 202200220210231 |
11 | 594776a4a61561 |
12 | 1a817910771447 |
13 | 88a9525654719 |
14 | 37d0785918ab5 |
15 | 1859a599dd8c1 |
hex | b7e6684c9437 |
202200220210231 has 2 divisors, whose sum is σ = 202200220210232. Its totient is φ = 202200220210230.
The previous prime is 202200220210193. The next prime is 202200220210237. The reversal of 202200220210231 is 132012022002202.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 202200220210231 - 215 = 202200220177463 is a prime.
It is a super-2 number, since 2×2022002202102312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 202200220210199 and 202200220210208.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (202200220210237) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 101100110105115 + 101100110105116.
It is an arithmetic number, because the mean of its divisors is an integer number (101100110105116).
Almost surely, 2202200220210231 is an apocalyptic number.
202200220210231 is a deficient number, since it is larger than the sum of its proper divisors (1).
202200220210231 is an equidigital number, since it uses as much as digits as its factorization.
202200220210231 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 384, while the sum is 19.
Adding to 202200220210231 its reverse (132012022002202), we get a palindrome (334212242212433).
The spelling of 202200220210231 in words is "two hundred two trillion, two hundred billion, two hundred twenty million, two hundred ten thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •