Base | Representation |
---|---|
bin | 100110101010… |
… | …0001110011000 |
3 | 1102010201101000 |
4 | 1031110032120 |
5 | 20142033203 |
6 | 2002225000 |
7 | 334163112 |
oct | 115241630 |
9 | 42121330 |
10 | 20267928 |
11 | 1049365a |
12 | 6955160 |
13 | 4278375 |
14 | 29983b2 |
15 | 1ba54a3 |
hex | 1354398 |
20267928 has 64 divisors (see below), whose sum is σ = 56908800. Its totient is φ = 6683040.
The previous prime is 20267911. The next prime is 20267953. The reversal of 20267928 is 82976202.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a junction number, because it is equal to n+sod(n) for n = 20267892 and 20267901.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 21793 + ... + 22703.
It is an arithmetic number, because the mean of its divisors is an integer number (889200).
Almost surely, 220267928 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 20267928, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (28454400).
20267928 is an abundant number, since it is smaller than the sum of its proper divisors (36640872).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20267928 is a wasteful number, since it uses less digits than its factorization.
20267928 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1029 (or 1019 counting only the distinct ones).
The product of its (nonzero) digits is 24192, while the sum is 36.
The square root of 20267928 is about 4501.9915592991. The cubic root of 20267928 is about 272.6485030700.
The spelling of 20267928 in words is "twenty million, two hundred sixty-seven thousand, nine hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •