Base | Representation |
---|---|
bin | 11101001000110011101… |
… | …001100110001011011001 |
3 | 21002102100012210012222212 |
4 | 131020303221212023121 |
5 | 230301223223132413 |
6 | 4131504222324505 |
7 | 264443250151040 |
oct | 35106351461331 |
9 | 7072305705885 |
10 | 2002321302233 |
11 | 7021a81a158a |
12 | 284091429735 |
13 | 116a834575a5 |
14 | 6ccacca5557 |
15 | 37141baaca8 |
hex | 1d233a662d9 |
2002321302233 has 8 divisors (see below), whose sum is σ = 2288402094720. Its totient is φ = 1716249232800.
The previous prime is 2002321302227. The next prime is 2002321302259. The reversal of 2002321302233 is 3322031232002.
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 2002321302233 - 210 = 2002321301209 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2002321302199 and 2002321302208.
It is not an unprimeable number, because it can be changed into a prime (2002321302533) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1681253 + ... + 2613666.
It is an arithmetic number, because the mean of its divisors is an integer number (286050261840).
Almost surely, 22002321302233 is an apocalyptic number.
It is an amenable number.
2002321302233 is a deficient number, since it is larger than the sum of its proper divisors (286080792487).
2002321302233 is an equidigital number, since it uses as much as digits as its factorization.
2002321302233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4361527.
The product of its (nonzero) digits is 2592, while the sum is 23.
Adding to 2002321302233 its reverse (3322031232002), we get a palindrome (5324352534235).
The spelling of 2002321302233 in words is "two trillion, two billion, three hundred twenty-one million, three hundred two thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •