Base | Representation |
---|---|
bin | 100110011001… |
… | …1001000110000 |
3 | 1101212211110110 |
4 | 1030303020300 |
5 | 20123214100 |
6 | 1555301320 |
7 | 333060021 |
oct | 114631060 |
9 | 41784413 |
10 | 20132400 |
11 | 10400852 |
12 | 68aa840 |
13 | 422b782 |
14 | 2960c48 |
15 | 1b7a250 |
hex | 1333230 |
20132400 has 120 divisors (see below), whose sum is σ = 67961920. Its totient is φ = 5080320.
The previous prime is 20132389. The next prime is 20132401. The reversal of 20132400 is 423102.
It is a tau number, because it is divible by the number of its divisors (120).
It is a Harshad number since it is a multiple of its sum of digits (12).
It is not an unprimeable number, because it can be changed into a prime (20132401) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 22359 + ... + 23241.
Almost surely, 220132400 is an apocalyptic number.
20132400 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 20132400, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (33980960).
20132400 is an abundant number, since it is smaller than the sum of its proper divisors (47829520).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20132400 is a wasteful number, since it uses less digits than its factorization.
20132400 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 923 (or 912 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 12.
The square root of 20132400 is about 4486.9143071826. The cubic root of 20132400 is about 272.0394262342.
Adding to 20132400 its reverse (423102), we get a palindrome (20555502).
The spelling of 20132400 in words is "twenty million, one hundred thirty-two thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •