Base | Representation |
---|---|
bin | 110010101101000110111010… |
… | …010001000100011001001001 |
3 | 1002020120210110022022020012221 |
4 | 302231012322101010121021 |
5 | 213212131321213342413 |
6 | 2110141432141134041 |
7 | 64654241320400224 |
oct | 6255067221043111 |
9 | 1066523408266187 |
10 | 223002122012233 |
11 | 6506773a24a283 |
12 | 2101737b55a321 |
13 | 97580188c9945 |
14 | 3d0d5089145bb |
15 | 1ababe4acd68d |
hex | cad1ba444649 |
223002122012233 has 16 divisors (see below), whose sum is σ = 229698337500864. Its totient is φ = 216341173546560.
The previous prime is 223002122012227. The next prime is 223002122012237. The reversal of 223002122012233 is 332210221200322.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-223002122012233 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 223002122012198 and 223002122012207.
It is not an unprimeable number, because it can be changed into a prime (223002122012237) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 336397323 + ... + 337059583.
It is an arithmetic number, because the mean of its divisors is an integer number (14356146093804).
Almost surely, 2223002122012233 is an apocalyptic number.
It is an amenable number.
223002122012233 is a deficient number, since it is larger than the sum of its proper divisors (6696215488631).
223002122012233 is a wasteful number, since it uses less digits than its factorization.
223002122012233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 688872.
The product of its (nonzero) digits is 3456, while the sum is 25.
Adding to 223002122012233 its reverse (332210221200322), we get a palindrome (555212343212555).
The spelling of 223002122012233 in words is "two hundred twenty-three trillion, two billion, one hundred twenty-two million, twelve thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •