Base | Representation |
---|---|
bin | 11101010001000100111… |
… | …000010111111010100000 |
3 | 21010021021000020020000110 |
4 | 131101010320113322200 |
5 | 230422414240320412 |
6 | 4135533242451320 |
7 | 265206263452452 |
oct | 35210470277240 |
9 | 7107230206013 |
10 | 2011200323232 |
11 | 705a44172471 |
12 | 28594ab03b40 |
13 | 117869b2a179 |
14 | 6d4b21c82d2 |
15 | 374b143bd3c |
hex | 1d444e17ea0 |
2011200323232 has 24 divisors (see below), whose sum is σ = 5279400848736. Its totient is φ = 670400107712.
The previous prime is 2011200323201. The next prime is 2011200323369. The reversal of 2011200323232 is 2323230021102.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (24).
It is a junction number, because it is equal to n+sod(n) for n = 2011200323199 and 2011200323208.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 10475001588 + ... + 10475001779.
It is an arithmetic number, because the mean of its divisors is an integer number (219975035364).
Almost surely, 22011200323232 is an apocalyptic number.
It is an amenable number.
2011200323232 is an abundant number, since it is smaller than the sum of its proper divisors (3268200525504).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2011200323232 is a wasteful number, since it uses less digits than its factorization.
2011200323232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20950003380 (or 20950003372 counting only the distinct ones).
The product of its (nonzero) digits is 864, while the sum is 21.
Adding to 2011200323232 its reverse (2323230021102), we get a palindrome (4334430344334).
The spelling of 2011200323232 in words is "two trillion, eleven billion, two hundred million, three hundred twenty-three thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •