Base | Representation |
---|---|
bin | 100110111010… |
… | …0101100111000 |
3 | 1102101110211211 |
4 | 1031310230320 |
5 | 20210312302 |
6 | 2005132504 |
7 | 335255665 |
oct | 115645470 |
9 | 42343754 |
10 | 20400952 |
11 | 105745a0 |
12 | 69ba134 |
13 | 42c3a90 |
14 | 29d0a6c |
15 | 1bcead7 |
hex | 1374b38 |
20400952 has 64 divisors (see below), whose sum is σ = 47628000. Its totient is φ = 8048640.
The previous prime is 20400869. The next prime is 20400959. The reversal of 20400952 is 25900402.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (22).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20400959) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 18924 + ... + 19972.
Almost surely, 220400952 is an apocalyptic number.
20400952 is a gapful number since it is divisible by the number (22) 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 20400952, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (23814000).
20400952 is an abundant number, since it is smaller than the sum of its proper divisors (27227048).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20400952 is a wasteful number, since it uses less digits than its factorization.
20400952 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1096 (or 1092 counting only the distinct ones).
The product of its (nonzero) digits is 720, while the sum is 22.
The square root of 20400952 is about 4516.7413031964. The cubic root of 20400952 is about 273.2436919346.
The spelling of 20400952 in words is "twenty million, four hundred thousand, nine hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •