Base | Representation |
---|---|
bin | 10100100000000111… |
… | …110101001000000000 |
3 | 2002211011202212122110 |
4 | 110200013311020000 |
5 | 330041010310000 |
6 | 14040223135320 |
7 | 1406343605211 |
oct | 244007651000 |
9 | 62734685573 |
10 | 22013760000 |
11 | 9377214791 |
12 | 4324444540 |
13 | 20ca95c0bb |
14 | 10cb923408 |
15 | 88c94a850 |
hex | 5201f5200 |
22013760000 has 400 divisors, whose sum is σ = 76547047104. Its totient is φ = 5609472000.
The previous prime is 22013759983. The next prime is 22013760007. The reversal of 22013760000 is 6731022.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (400).
It is not an unprimeable number, because it can be changed into a prime (22013760007) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 22079502 + ... + 22080498.
Almost surely, 222013760000 is an apocalyptic number.
22013760000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 22013760000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (38273523552).
22013760000 is an abundant number, since it is smaller than the sum of its proper divisors (54533287104).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
22013760000 is an frugal number, since it uses more digits than its factorization.
22013760000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1061 (or 1030 counting only the distinct ones).
The product of its (nonzero) digits is 504, while the sum is 21.
The spelling of 22013760000 in words is "twenty-two billion, thirteen million, seven hundred sixty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •