Base | Representation |
---|---|
bin | 11101001000110010100… |
… | …000010110111100011000 |
3 | 21002102021212122211001000 |
4 | 131020302200112330120 |
5 | 230301203314301240 |
6 | 4131502255025000 |
7 | 264442625026401 |
oct | 35106240267430 |
9 | 7072255584030 |
10 | 2002302103320 |
11 | 702198379112 |
12 | 284086b0b160 |
13 | 116a7c49499c |
14 | 6ccaa5089a8 |
15 | 37140167430 |
hex | 1d232816f18 |
2002302103320 has 128 divisors (see below), whose sum is σ = 6733405713600. Its totient is φ = 529221998592.
The previous prime is 2002302103309. The next prime is 2002302103381. The reversal of 2002302103320 is 233012032002.
It is a happy number.
2002302103320 is a `hidden beast` number, since 20 + 0 + 2 + 302 + 10 + 332 + 0 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 2002302103293 and 2002302103302.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 8081427 + ... + 8325506.
Almost surely, 22002302103320 is an apocalyptic number.
2002302103320 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2002302103320 is an abundant number, since it is smaller than the sum of its proper divisors (4731103610280).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2002302103320 is a wasteful number, since it uses less digits than its factorization.
2002302103320 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16407066 (or 16407056 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 18.
Adding to 2002302103320 its reverse (233012032002), we get a palindrome (2235314135322).
The spelling of 2002302103320 in words is "two trillion, two billion, three hundred two million, one hundred three thousand, three hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •