Base | Representation |
---|---|
bin | 11101001001011100000… |
… | …110101010100101100110 |
3 | 21002111002111220012112200 |
4 | 131021130012222211212 |
5 | 230304121000323420 |
6 | 4132055425355330 |
7 | 264466131115110 |
oct | 35113406524546 |
9 | 7074074805480 |
10 | 2003000011110 |
11 | 70251631960a |
12 | 284240798b46 |
13 | 116b60c50987 |
14 | 6cd3509a3b0 |
15 | 37181574b90 |
hex | 1d25c1aa966 |
2003000011110 has 96 divisors (see below), whose sum is σ = 5952250025280. Its totient is φ = 457791761664.
The previous prime is 2003000011109. The next prime is 2003000011121. The reversal of 2003000011110 is 111100003002.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 2003000011092 and 2003000011101.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 8137404 + ... + 8379936.
It is an arithmetic number, because the mean of its divisors is an integer number (62002604430).
Almost surely, 22003000011110 is an apocalyptic number.
2003000011110 is an abundant number, since it is smaller than the sum of its proper divisors (3949250014170).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2003000011110 is a wasteful number, since it uses less digits than its factorization.
2003000011110 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 255662 (or 255659 counting only the distinct ones).
The product of its (nonzero) digits is 6, while the sum is 9.
Adding to 2003000011110 its reverse (111100003002), we get a palindrome (2114100014112).
The spelling of 2003000011110 in words is "two trillion, three billion, eleven thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •