Base | Representation |
---|---|
bin | 10100100000000110… |
… | …001000011110111000 |
3 | 2002211010221021012222 |
4 | 110200012020132320 |
5 | 330040402040000 |
6 | 14040205423212 |
7 | 1406340042635 |
oct | 244006103670 |
9 | 62733837188 |
10 | 22013315000 |
11 | 9376a40416 |
12 | 432426ab08 |
13 | 20ca8346a1 |
14 | 10cb84918c |
15 | 88c8ada85 |
hex | 5201887b8 |
22013315000 has 40 divisors (see below), whose sum is σ = 51577208760. Its totient is φ = 8805324000.
The previous prime is 22013314901. The next prime is 22013315033. The reversal of 22013315000 is 51331022.
It is a tau number, because it is divible by the number of its divisors (40).
It is a self number, because there is not a number n which added to its sum of digits gives 22013315000.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 2196332 + ... + 2206331.
It is an arithmetic number, because the mean of its divisors is an integer number (1289430219).
Almost surely, 222013315000 is an apocalyptic number.
22013315000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
22013315000 is an abundant number, since it is smaller than the sum of its proper divisors (29563893760).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
22013315000 is an equidigital number, since it uses as much as digits as its factorization.
22013315000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4402689 (or 4402670 counting only the distinct ones).
The product of its (nonzero) digits is 180, while the sum is 17.
Adding to 22013315000 its reverse (51331022), we get a palindrome (22064646022).
The spelling of 22013315000 in words is "twenty-two billion, thirteen million, three hundred fifteen thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •