Base | Representation |
---|---|
bin | 11101001000101101001… |
… | …100100101010010100011 |
3 | 21002102001200001120200211 |
4 | 131020231030211102203 |
5 | 230301013014024443 |
6 | 4131445353554551 |
7 | 264440463655462 |
oct | 35105514452243 |
9 | 7072050046624 |
10 | 2002213033123 |
11 | 702152072386 |
12 | 284061115a57 |
13 | 116a66baa024 |
14 | 6cc9c7609d9 |
15 | 3713742119d |
hex | 1d22d3254a3 |
2002213033123 has 4 divisors (see below), whose sum is σ = 2002231605520. Its totient is φ = 2002194460728.
The previous prime is 2002213033057. The next prime is 2002213033151. The reversal of 2002213033123 is 3213303122002.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 2002213033123 - 217 = 2002212902051 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2002213033094 and 2002213033103.
It is not an unprimeable number, because it can be changed into a prime (2002213003123) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 9123540 + ... + 9340417.
It is an arithmetic number, because the mean of its divisors is an integer number (500557901380).
Almost surely, 22002213033123 is an apocalyptic number.
2002213033123 is a deficient number, since it is larger than the sum of its proper divisors (18572397).
2002213033123 is a wasteful number, since it uses less digits than its factorization.
2002213033123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18572396.
The product of its (nonzero) digits is 1296, while the sum is 22.
Adding to 2002213033123 its reverse (3213303122002), we get a palindrome (5215516155125).
The spelling of 2002213033123 in words is "two trillion, two billion, two hundred thirteen million, thirty-three thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •