Base | Representation |
---|---|
bin | 100000000001000110111… |
… | …010100101111001001001 |
3 | 21210100010121222002021202 |
4 | 200001012322211321021 |
5 | 242022014013121413 |
6 | 4402433000513545 |
7 | 314650221045224 |
oct | 40010672457111 |
9 | 7710117862252 |
10 | 2200213020233 |
11 | 779117988268 |
12 | 2b64baa7b8b5 |
13 | 12c62ca49007 |
14 | 786c2d825bb |
15 | 3c374ecde58 |
hex | 20046ea5e49 |
2200213020233 has 8 divisors (see below), whose sum is σ = 2205681106560. Its totient is φ = 2194745366880.
The previous prime is 2200213020223. The next prime is 2200213020259. The reversal of 2200213020233 is 3320203120022.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2200213020233 - 210 = 2200213019209 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (2200213020223) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 11649116 + ... + 11836482.
It is an arithmetic number, because the mean of its divisors is an integer number (275710138320).
Almost surely, 22200213020233 is an apocalyptic number.
It is an amenable number.
2200213020233 is a deficient number, since it is larger than the sum of its proper divisors (5468086327).
2200213020233 is a wasteful number, since it uses less digits than its factorization.
2200213020233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 216487.
The product of its (nonzero) digits is 864, while the sum is 20.
Adding to 2200213020233 its reverse (3320203120022), we get a palindrome (5520416140255).
The spelling of 2200213020233 in words is "two trillion, two hundred billion, two hundred thirteen million, twenty thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •