Base | Representation |
---|---|
bin | 11101001000100010011… |
… | …110100101100010000010 |
3 | 21002101121010200021121010 |
4 | 131020202132211202002 |
5 | 230300131000001310 |
6 | 4131415451341350 |
7 | 264433151306406 |
oct | 35104236454202 |
9 | 7071533607533 |
10 | 2002033203330 |
11 | 70206a606616 |
12 | 284010a51856 |
13 | 116a38865774 |
14 | 6cc8290d106 |
15 | 3712674d320 |
hex | 1d2227a5882 |
2002033203330 has 64 divisors (see below), whose sum is σ = 4933183989888. Its totient is φ = 519678282240.
The previous prime is 2002033203301. The next prime is 2002033203337. The reversal of 2002033203330 is 333023302002.
It is a super-2 number, since 2×20020332033302 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2002033203297 and 2002033203306.
It is not an unprimeable number, because it can be changed into a prime (2002033203337) 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 31 ways as a sum of consecutive naturals, for example, 1292209 + ... + 2381988.
It is an arithmetic number, because the mean of its divisors is an integer number (77080999842).
Almost surely, 22002033203330 is an apocalyptic number.
2002033203330 is an abundant number, since it is smaller than the sum of its proper divisors (2931150786558).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2002033203330 is a wasteful number, since it uses less digits than its factorization.
2002033203330 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3674691.
The product of its (nonzero) digits is 1944, while the sum is 21.
Adding to 2002033203330 its reverse (333023302002), we get a palindrome (2335056505332).
The spelling of 2002033203330 in words is "two trillion, two billion, thirty-three million, two hundred three thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •