Base | Representation |
---|---|
bin | 10100100111000011… |
… | …010111011000110010 |
3 | 2010010021120000021120 |
4 | 110213003113120302 |
5 | 330310241431010 |
6 | 14055535203110 |
7 | 1412255103165 |
oct | 244703273062 |
9 | 63107500246 |
10 | 22130030130 |
11 | 94269091aa |
12 | 4357376496 |
13 | 2118a7b3b0 |
14 | 10dd14badc |
15 | 897c65e70 |
hex | 5270d7632 |
22130030130 has 64 divisors (see below), whose sum is σ = 57410519040. Its totient is φ = 5427115776.
The previous prime is 22130030101. The next prime is 22130030137. The reversal of 22130030130 is 3103003122.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is not an unprimeable number, because it can be changed into a prime (22130030137) 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 31 ways as a sum of consecutive naturals, for example, 562 + ... + 210381.
It is an arithmetic number, because the mean of its divisors is an integer number (897039360).
Almost surely, 222130030130 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 22130030130, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (28705259520).
22130030130 is an abundant number, since it is smaller than the sum of its proper divisors (35280488910).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
22130030130 is a wasteful number, since it uses less digits than its factorization.
22130030130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 211235.
The product of its (nonzero) digits is 108, while the sum is 15.
Adding to 22130030130 its reverse (3103003122), we get a palindrome (25233033252).
The spelling of 22130030130 in words is "twenty-two billion, one hundred thirty million, thirty thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •