Base | Representation |
---|---|
bin | 100110010001… |
… | …1101111111010 |
3 | 1101202122000000 |
4 | 1030203233322 |
5 | 20114204440 |
6 | 1554053430 |
7 | 332405166 |
oct | 114435772 |
9 | 41678000 |
10 | 20069370 |
11 | 10368462 |
12 | 687a276 |
13 | 4208b89 |
14 | 2945ca6 |
15 | 1b66730 |
hex | 1323bfa |
20069370 has 56 divisors (see below), whose sum is σ = 54182196. Its totient is φ = 5349888.
The previous prime is 20069359. The next prime is 20069383. The reversal of 20069370 is 7396002.
It can be written as a sum of positive squares in 2 ways, for example, as 19368801 + 700569 = 4401^2 + 837^2 .
It is a super-2 number, since 2×200693702 = 805559224393800, which contains 22 as substring.
It is a hoax number, since the sum of its digits (27) coincides with the sum of the digits of its distinct prime factors.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is an unprimeable number.
It is a polite number, since it can be written in 27 ways as a sum of consecutive naturals, for example, 5914 + ... + 8666.
Almost surely, 220069370 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 20069370, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (27091098).
20069370 is an abundant number, since it is smaller than the sum of its proper divisors (34112826).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20069370 is an equidigital number, since it uses as much as digits as its factorization.
20069370 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2778 (or 2763 counting only the distinct ones).
The product of its (nonzero) digits is 2268, while the sum is 27.
The square root of 20069370 is about 4479.8850431680. The cubic root of 20069370 is about 271.7552314318.
The spelling of 20069370 in words is "twenty million, sixty-nine thousand, three hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •