Base | Representation |
---|---|
bin | 10010101111111110… |
… | …010000110111100000 |
3 | 1220222001021221001012 |
4 | 102233332100313200 |
5 | 312212321012000 |
6 | 13125411000052 |
7 | 1311615624206 |
oct | 225776206740 |
9 | 56861257035 |
10 | 20132204000 |
11 | 85a1116927 |
12 | 3a9a299028 |
13 | 1b8abb565c |
14 | d8da9b076 |
15 | 7cc682735 |
hex | 4aff90de0 |
20132204000 has 96 divisors (see below), whose sum is σ = 49822063200. Its totient is φ = 7994726400.
The previous prime is 20132203967. The next prime is 20132204011. The reversal of 20132204000 is 40223102.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 537896 + ... + 574104.
It is an arithmetic number, because the mean of its divisors is an integer number (518979825).
Almost surely, 220132204000 is an apocalyptic number.
20132204000 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 20132204000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (24911031600).
20132204000 is an abundant number, since it is smaller than the sum of its proper divisors (29689859200).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20132204000 is a wasteful number, since it uses less digits than its factorization.
20132204000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36373 (or 36355 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 14.
Adding to 20132204000 its reverse (40223102), we get a palindrome (20172427102).
The spelling of 20132204000 in words is "twenty billion, one hundred thirty-two million, two hundred four thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •