Base | Representation |
---|---|
bin | 11101001001101001010… |
… | …101111010101101100000 |
3 | 21002111122222211011020001 |
4 | 131021221111322231200 |
5 | 230310044330104440 |
6 | 4132133442025344 |
7 | 264504466004614 |
oct | 35115125725540 |
9 | 7074588734201 |
10 | 2003222113120 |
11 | 70261a728098 |
12 | 2842a3048254 |
13 | 116b97c76097 |
14 | 6cd56793344 |
15 | 37195ce7b9a |
hex | 1d26957ab60 |
2003222113120 has 96 divisors (see below), whose sum is σ = 4741948461600. Its totient is φ = 799709761536.
The previous prime is 2003222113111. The next prime is 2003222113121. The reversal of 2003222113120 is 213112223002.
It is a super-2 number, since 2×20032221131202 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2003222113121) 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, 187054326 + ... + 187065034.
It is an arithmetic number, because the mean of its divisors is an integer number (49395296475).
Almost surely, 22003222113120 is an apocalyptic number.
2003222113120 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2003222113120 is an abundant number, since it is smaller than the sum of its proper divisors (2738726348480).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2003222113120 is a wasteful number, since it uses less digits than its factorization.
2003222113120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12920 (or 12912 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 19.
Adding to 2003222113120 its reverse (213112223002), we get a palindrome (2216334336122).
The spelling of 2003222113120 in words is "two trillion, three billion, two hundred twenty-two million, one hundred thirteen thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.022 sec. • engine limits •