Base | Representation |
---|---|
bin | 11101001000100010010… |
… | …111011100010000010000 |
3 | 21002101121000011010022101 |
4 | 131020202113130100100 |
5 | 230300130010032240 |
6 | 4131415343250144 |
7 | 264433126345630 |
oct | 35104227342020 |
9 | 7071530133271 |
10 | 2002031330320 |
11 | 70206954737a |
12 | 2840102a9954 |
13 | 116a3835b088 |
14 | 6cc825826c0 |
15 | 371264cd39a |
hex | 1d2225dc410 |
2002031330320 has 80 divisors (see below), whose sum is σ = 5320326763008. Its totient is φ = 686327708160.
The previous prime is 2002031330311. The next prime is 2002031330329. The reversal of 2002031330320 is 230331302002.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (2002031330311) and next prime (2002031330329).
It is a tau number, because it is divible by the number of its divisors (80).
It is not an unprimeable number, because it can be changed into a prime (2002031330329) 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, 4509342 + ... + 4933378.
Almost surely, 22002031330320 is an apocalyptic number.
2002031330320 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2002031330320 is an abundant number, since it is smaller than the sum of its proper divisors (3318295432688).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2002031330320 is a wasteful number, since it uses less digits than its factorization.
2002031330320 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 432488 (or 432482 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 19.
Adding to 2002031330320 its reverse (230331302002), we get a palindrome (2232362632322).
The spelling of 2002031330320 in words is "two trillion, two billion, thirty-one million, three hundred thirty thousand, three hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •