Base | Representation |
---|---|
bin | 11101001001101000110… |
… | …011100101001101000100 |
3 | 21002111122100212212012010 |
4 | 131021220303211031010 |
5 | 230310040024042012 |
6 | 4132132521054220 |
7 | 264504326335641 |
oct | 35115063451504 |
9 | 7074570785163 |
10 | 2003213112132 |
11 | 70261563a561 |
12 | 2842a0027370 |
13 | 116b9614415b |
14 | 6cd554ccdc8 |
15 | 3719511ac3c |
hex | 1d268ce5344 |
2003213112132 has 24 divisors (see below), whose sum is σ = 4679099714016. Its totient is φ = 667032591808.
The previous prime is 2003213112107. The next prime is 2003213112139. The reversal of 2003213112132 is 2312113123002.
It is a junction number, because it is equal to n+sod(n) for n = 2003213112099 and 2003213112108.
It is not an unprimeable number, because it can be changed into a prime (2003213112139) 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 7 ways as a sum of consecutive naturals, for example, 88127193 + ... + 88149920.
It is an arithmetic number, because the mean of its divisors is an integer number (194962488084).
Almost surely, 22003213112132 is an apocalyptic number.
It is an amenable number.
2003213112132 is an abundant number, since it is smaller than the sum of its proper divisors (2675886601884).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2003213112132 is a wasteful number, since it uses less digits than its factorization.
2003213112132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 176278067 (or 176278065 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 2003213112132 its reverse (2312113123002), we get a palindrome (4315326235134).
The spelling of 2003213112132 in words is "two trillion, three billion, two hundred thirteen million, one hundred twelve thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •