Base | Representation |
---|---|
bin | 11101001001100010101… |
… | …111001111001100101000 |
3 | 21002111101021022210002020 |
4 | 131021202233033030220 |
5 | 230304332443410440 |
6 | 4132114443104440 |
7 | 264501652130034 |
oct | 35114257171450 |
9 | 7074337283066 |
10 | 2003111310120 |
11 | 702573128168 |
12 | 284271b12120 |
13 | 116b7b01c38b |
14 | 6cd45b8d1c4 |
15 | 3718b20c3d0 |
hex | 1d262bcf328 |
2003111310120 has 64 divisors (see below), whose sum is σ = 6025024235520. Its totient is φ = 532768322304.
The previous prime is 2003111310107. The next prime is 2003111310217. The reversal of 2003111310120 is 210131113002.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 2003111310120.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 21745939 + ... + 21837858.
It is an arithmetic number, because the mean of its divisors is an integer number (94141003680).
Almost surely, 22003111310120 is an apocalyptic number.
2003111310120 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2003111310120 is an abundant number, since it is smaller than the sum of its proper divisors (4021912925400).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2003111310120 is a wasteful number, since it uses less digits than its factorization.
2003111310120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43584194 (or 43584190 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 2003111310120 its reverse (210131113002), we get a palindrome (2213242423122).
The spelling of 2003111310120 in words is "two trillion, three billion, one hundred eleven million, three hundred ten thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •