Base | Representation |
---|---|
bin | 111011101100110… |
… | …0110100001111010 |
3 | 12011121101002222010 |
4 | 1313121212201322 |
5 | 13100304400442 |
6 | 530435310350 |
7 | 100432630410 |
oct | 16731464172 |
9 | 5147332863 |
10 | 2003200122 |
11 | 9388329a0 |
12 | 47aa4b3b6 |
13 | 25c027b21 |
14 | 15008d2b0 |
15 | bace5b9c |
hex | 7766687a |
2003200122 has 64 divisors (see below), whose sum is σ = 5000822784. Its totient is φ = 519704640.
The previous prime is 2003200109. The next prime is 2003200139. The reversal of 2003200122 is 2210023002.
It is a junction number, because it is equal to n+sod(n) for n = 2003200098 and 2003200107.
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, 502983 + ... + 506949.
It is an arithmetic number, because the mean of its divisors is an integer number (78137856).
Almost surely, 22003200122 is an apocalyptic number.
2003200122 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 2003200122, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2500411392).
2003200122 is an abundant number, since it is smaller than the sum of its proper divisors (2997622662).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2003200122 is a wasteful number, since it uses less digits than its factorization.
2003200122 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5083.
The product of its (nonzero) digits is 48, while the sum is 12.
The square root of 2003200122 is about 44757.1237011495. The cubic root of 2003200122 is about 1260.5926753199.
Adding to 2003200122 its reverse (2210023002), we get a palindrome (4213223124).
The spelling of 2003200122 in words is "two billion, three million, two hundred thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •