Base | Representation |
---|---|
bin | 10100100111000011… |
… | …101011011000100000 |
3 | 2010010021201011121222 |
4 | 110213003223120200 |
5 | 330310302041112 |
6 | 14055541034212 |
7 | 1412255564030 |
oct | 244703533040 |
9 | 63107634558 |
10 | 22130112032 |
11 | 9426964796 |
12 | 43573b5968 |
13 | 2118aa9762 |
14 | 10dd16d8c0 |
15 | 897c80372 |
hex | 5270eb620 |
22130112032 has 192 divisors, whose sum is σ = 56509125120. Its totient is φ = 8306343936.
The previous prime is 22130112023. The next prime is 22130112089. The reversal of 22130112032 is 23021103122.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a self number, because there is not a number n which added to its sum of digits gives 22130112032.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 3237194 + ... + 3244022.
It is an arithmetic number, because the mean of its divisors is an integer number (294318360).
Almost surely, 222130112032 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 22130112032, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (28254562560).
22130112032 is an abundant number, since it is smaller than the sum of its proper divisors (34379013088).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
22130112032 is a wasteful number, since it uses less digits than its factorization.
22130112032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6923 (or 6915 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 22130112032 its reverse (23021103122), we get a palindrome (45151215154).
The spelling of 22130112032 in words is "twenty-two billion, one hundred thirty million, one hundred twelve thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •