Base | Representation |
---|---|
bin | 100111000010… |
… | …1010110110000 |
3 | 1102111221102100 |
4 | 1032011112300 |
5 | 20220003133 |
6 | 2010420400 |
7 | 335661606 |
oct | 116052660 |
9 | 42457370 |
10 | 20469168 |
11 | 10610875 |
12 | 6a31700 |
13 | 4318b45 |
14 | 2a0b876 |
15 | 1be4e13 |
hex | 13855b0 |
20469168 has 60 divisors (see below), whose sum is σ = 58699368. Its totient is φ = 6654720.
The previous prime is 20469167. The next prime is 20469179. The reversal of 20469168 is 86196402.
It is a super-2 number, since 2×204691682 = 837973677224448, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20469167) by changing a digit.
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 11 ways as a sum of consecutive naturals, for example, 4171 + ... + 7637.
Almost surely, 220469168 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 20469168, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (29349684).
20469168 is an abundant number, since it is smaller than the sum of its proper divisors (38230200).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20469168 is a wasteful number, since it uses less digits than its factorization.
20469168 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3522 (or 3513 counting only the distinct ones).
The product of its (nonzero) digits is 20736, while the sum is 36.
The square root of 20469168 is about 4524.2864630790. The cubic root of 20469168 is about 273.5479073902.
The spelling of 20469168 in words is "twenty million, four hundred sixty-nine thousand, one hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •