Base | Representation |
---|---|
bin | 11101001001101010100… |
… | …110000000111011010100 |
3 | 21002111201110022220122222 |
4 | 131021222212000323110 |
5 | 230310120214010400 |
6 | 4132135512041512 |
7 | 264505142325401 |
oct | 35115246007324 |
9 | 7074643286588 |
10 | 2003243110100 |
11 | 702630569471 |
12 | 2842aa093298 |
13 | 116b9c41822b |
14 | 6cd5949b2a8 |
15 | 37197a94185 |
hex | 1d26a980ed4 |
2003243110100 has 36 divisors (see below), whose sum is σ = 4575829003200. Its totient is φ = 759123704160.
The previous prime is 2003243110069. The next prime is 2003243110109. The reversal of 2003243110100 is 10113423002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2003243110109) 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 11 ways as a sum of consecutive naturals, for example, 527167340 + ... + 527171139.
It is an arithmetic number, because the mean of its divisors is an integer number (127106361200).
Almost surely, 22003243110100 is an apocalyptic number.
2003243110100 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2003243110100 is an abundant number, since it is smaller than the sum of its proper divisors (2572585893100).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2003243110100 is a wasteful number, since it uses less digits than its factorization.
2003243110100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1054338512 (or 1054338505 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 2003243110100 its reverse (10113423002), we get a palindrome (2013356533102).
The spelling of 2003243110100 in words is "two trillion, three billion, two hundred forty-three million, one hundred ten thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •