Base | Representation |
---|---|
bin | 11101001000100010011… |
… | …110100100101110011110 |
3 | 21002101121010200010001220 |
4 | 131020202132210232132 |
5 | 230300130444400110 |
6 | 4131415451314210 |
7 | 264433151263653 |
oct | 35104236445636 |
9 | 7071533603056 |
10 | 2002033200030 |
11 | 70206a604096 |
12 | 284010a4b966 |
13 | 116a38864106 |
14 | 6cc8290bc2a |
15 | 3712674c370 |
hex | 1d2227a4b9e |
2002033200030 has 32 divisors (see below), whose sum is σ = 4959875801088. Its totient is φ = 516653728800.
The previous prime is 2002033200029. The next prime is 2002033200031. The reversal of 2002033200030 is 300023302002.
It is an interprime number because it is at equal distance from previous prime (2002033200029) and next prime (2002033200031).
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a junction number, because it is equal to n+sod(n) for n = 2002033199982 and 2002033200009.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2002033200031) 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, 1076361006 + ... + 1076362865.
It is an arithmetic number, because the mean of its divisors is an integer number (154996118784).
Almost surely, 22002033200030 is an apocalyptic number.
2002033200030 is an abundant number, since it is smaller than the sum of its proper divisors (2957842601058).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2002033200030 is a wasteful number, since it uses less digits than its factorization.
2002033200030 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2152723912.
The product of its (nonzero) digits is 216, while the sum is 15.
Adding to 2002033200030 its reverse (300023302002), we get a palindrome (2302056502032).
The spelling of 2002033200030 in words is "two trillion, two billion, thirty-three million, two hundred thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •