Base | Representation |
---|---|
bin | 100111110011… |
… | …0101101001000 |
3 | 1110021012101122 |
4 | 1033212231020 |
5 | 20320233122 |
6 | 2023134412 |
7 | 342242252 |
oct | 117465510 |
9 | 43235348 |
10 | 20867912 |
11 | 1086340a |
12 | 6ba4408 |
13 | 44284a0 |
14 | 2ab2cd2 |
15 | 1c73142 |
hex | 13e6b48 |
20867912 has 32 divisors (see below), whose sum is σ = 42430080. Its totient is φ = 9564480.
The previous prime is 20867911. The next prime is 20867933. The reversal of 20867912 is 21976802.
It is a happy number.
It is a super-3 number, since 3×208679123 (a number of 23 digits) contains 333 as substring.
It is not an unprimeable number, because it can be changed into a prime (20867911) 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 7 ways as a sum of consecutive naturals, for example, 16337 + ... + 17567.
It is an arithmetic number, because the mean of its divisors is an integer number (1325940).
Almost surely, 220867912 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 20867912, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (21215040).
20867912 is an abundant number, since it is smaller than the sum of its proper divisors (21562168).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20867912 is a wasteful number, since it uses less digits than its factorization.
20867912 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1413 (or 1409 counting only the distinct ones).
The product of its (nonzero) digits is 12096, while the sum is 35.
The square root of 20867912 is about 4568.1409785601. The cubic root of 20867912 is about 275.3127549157.
The spelling of 20867912 in words is "twenty million, eight hundred sixty-seven thousand, nine hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •