Base | Representation |
---|---|
bin | 10100011111010111… |
… | …100101100010010000 |
3 | 2002210021222100112122 |
4 | 110133113211202100 |
5 | 330024241110412 |
6 | 14035052113412 |
7 | 1406131243160 |
oct | 243727454220 |
9 | 62707870478 |
10 | 22001113232 |
11 | 937006700a |
12 | 4320165868 |
13 | 20c81518c7 |
14 | 10c9d905a0 |
15 | 88b79d572 |
hex | 51f5e5890 |
22001113232 has 120 divisors (see below), whose sum is σ = 52390950336. Its totient is φ = 8763386112.
The previous prime is 22001113201. The next prime is 22001113237. The reversal of 22001113232 is 23231110022.
It is a self number, because there is not a number n which added to its sum of digits gives 22001113232.
It is not an unprimeable number, because it can be changed into a prime (22001113237) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 2137763 + ... + 2148029.
Almost surely, 222001113232 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 22001113232, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (26195475168).
22001113232 is an abundant number, since it is smaller than the sum of its proper divisors (30389837104).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
22001113232 is a wasteful number, since it uses less digits than its factorization.
22001113232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10373 (or 10348 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 22001113232 its reverse (23231110022), we get a palindrome (45232223254).
The spelling of 22001113232 in words is "twenty-two billion, one million, one hundred thirteen thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •