Base | Representation |
---|---|
bin | 11101001001101000110… |
… | …011100111001101000000 |
3 | 21002111122100220021102101 |
4 | 131021220303213031000 |
5 | 230310040024322240 |
6 | 4132132521200144 |
7 | 264504326401546 |
oct | 35115063471500 |
9 | 7074570807371 |
10 | 2003213120320 |
11 | 702615645725 |
12 | 2842a0030054 |
13 | 116b96147ab9 |
14 | 6cd554d1d96 |
15 | 3719511d39a |
hex | 1d268ce7340 |
2003213120320 has 56 divisors (see below), whose sum is σ = 4770560277504. Its totient is φ = 801216539136.
The previous prime is 2003213120273. The next prime is 2003213120327. The reversal of 2003213120320 is 230213123002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2003213120327) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 3554209 + ... + 4079071.
It is an arithmetic number, because the mean of its divisors is an integer number (85188576384).
Almost surely, 22003213120320 is an apocalyptic number.
2003213120320 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2003213120320 is an abundant number, since it is smaller than the sum of its proper divisors (2767347157184).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2003213120320 is a wasteful number, since it uses less digits than its factorization.
2003213120320 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 536807 (or 536797 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 19.
Adding to 2003213120320 its reverse (230213123002), we get a palindrome (2233426243322).
The spelling of 2003213120320 in words is "two trillion, three billion, two hundred thirteen million, one hundred twenty thousand, three hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •