Base | Representation |
---|---|
bin | 100000001011100011100… |
… | …111111111000011000000 |
3 | 21211102002111122101111210 |
4 | 200023203213333003000 |
5 | 242213003104200112 |
6 | 4411530132410120 |
7 | 315525230462541 |
oct | 40134347770300 |
9 | 7742074571453 |
10 | 2211432100032 |
11 | 78295484aa41 |
12 | 2b8710176940 |
13 | 1306ca17b27c |
14 | 79068da04c8 |
15 | 3c7cede5b3c |
hex | 202e39ff0c0 |
2211432100032 has 56 divisors (see below), whose sum is σ = 6009218101936. Its totient is φ = 717221219328.
The previous prime is 2211432100001. The next prime is 2211432100037. The reversal of 2211432100032 is 2300012341122.
It is a junction number, because it is equal to n+sod(n) for n = 2211432099981 and 2211432100008.
It is not an unprimeable number, because it can be changed into a prime (2211432100037) 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, 155639863 + ... + 155654070.
It is an arithmetic number, because the mean of its divisors is an integer number (107307466106).
Almost surely, 22211432100032 is an apocalyptic number.
It is an amenable number.
2211432100032 is an abundant number, since it is smaller than the sum of its proper divisors (3797786001904).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2211432100032 is a wasteful number, since it uses less digits than its factorization.
2211432100032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 311293985 (or 311293975 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 21.
Adding to 2211432100032 its reverse (2300012341122), we get a palindrome (4511444441154).
The spelling of 2211432100032 in words is "two trillion, two hundred eleven billion, four hundred thirty-two million, one hundred thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •