Base | Representation |
---|---|
bin | 110010101101000110001010… |
… | …011110100001100001000111 |
3 | 1002020120201101102121121220221 |
4 | 302231012022132201201013 |
5 | 213212123200434424111 |
6 | 2110141220420205211 |
7 | 64654212413363434 |
oct | 6255061236414107 |
9 | 1066521342547827 |
10 | 223001320233031 |
11 | 6506736870373a |
12 | 21017196b39807 |
13 | 9757c1b772c92 |
14 | 3d0d470244b8b |
15 | 1abab99504371 |
hex | cad18a7a1847 |
223001320233031 has 2 divisors, whose sum is σ = 223001320233032. Its totient is φ = 223001320233030.
The previous prime is 223001320233017. The next prime is 223001320233049. The reversal of 223001320233031 is 130332023100322.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 223001320233031 - 27 = 223001320232903 is a prime.
It is a super-2 number, since 2×2230013202330312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 223001320232987 and 223001320233005.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (223001320233631) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 111500660116515 + 111500660116516.
It is an arithmetic number, because the mean of its divisors is an integer number (111500660116516).
Almost surely, 2223001320233031 is an apocalyptic number.
223001320233031 is a deficient number, since it is larger than the sum of its proper divisors (1).
223001320233031 is an equidigital number, since it uses as much as digits as its factorization.
223001320233031 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3888, while the sum is 25.
Adding to 223001320233031 its reverse (130332023100322), we get a palindrome (353333343333353).
The spelling of 223001320233031 in words is "two hundred twenty-three trillion, one billion, three hundred twenty million, two hundred thirty-three thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •