Base | Representation |
---|---|
bin | 11101001000110110000… |
… | …101010011110101000100 |
3 | 21002102110001121001120001 |
4 | 131020312011103311010 |
5 | 230301314200342130 |
6 | 4131512241251044 |
7 | 264444254130544 |
oct | 35106605236504 |
9 | 7072401531501 |
10 | 2002362121540 |
11 | 702219241750 |
12 | 2840a3033a84 |
13 | 116a8ba4a021 |
14 | 6ccb448d324 |
15 | 371455706ca |
hex | 1d236153d44 |
2002362121540 has 48 divisors (see below), whose sum is σ = 4632647753664. Its totient is φ = 720922448000.
The previous prime is 2002362121523. The next prime is 2002362121603. The reversal of 2002362121540 is 451212632002.
It is a junction number, because it is equal to n+sod(n) for n = 2002362121499 and 2002362121508.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 45035434 + ... + 45079873.
It is an arithmetic number, because the mean of its divisors is an integer number (96513494868).
Almost surely, 22002362121540 is an apocalyptic number.
2002362121540 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2002362121540 is an abundant number, since it is smaller than the sum of its proper divisors (2630285632124).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2002362121540 is a wasteful number, since it uses less digits than its factorization.
2002362121540 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 90115428 (or 90115426 counting only the distinct ones).
The product of its (nonzero) digits is 5760, while the sum is 28.
Adding to 2002362121540 its reverse (451212632002), we get a palindrome (2453574753542).
The spelling of 2002362121540 in words is "two trillion, two billion, three hundred sixty-two million, one hundred twenty-one thousand, five hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •