Base | Representation |
---|---|
bin | 10011010001001110… |
… | …011101001101101000 |
3 | 1222101221001211100220 |
4 | 103101032131031220 |
5 | 314333131101000 |
6 | 13301020330040 |
7 | 1331501631336 |
oct | 232116351550 |
9 | 58357054326 |
10 | 20690097000 |
11 | 8858025121 |
12 | 40150a3920 |
13 | 1c4965a661 |
14 | 1003c02b56 |
15 | 8116341a0 |
hex | 4d139d368 |
20690097000 has 128 divisors (see below), whose sum is σ = 65279260800. Its totient is φ = 5455296000.
The previous prime is 20690096983. The next prime is 20690097013. The reversal of 20690097000 is 79009602.
It is a super-2 number, since 2×206900970002 (a number of 21 digits) contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 228255 + ... + 305745.
It is an arithmetic number, because the mean of its divisors is an integer number (509994225).
Almost surely, 220690097000 is an apocalyptic number.
20690097000 is a gapful number since it is divisible by the number (20) 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 20690097000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (32639630400).
20690097000 is an abundant number, since it is smaller than the sum of its proper divisors (44589163800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20690097000 is a wasteful number, since it uses less digits than its factorization.
20690097000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 77604 (or 77590 counting only the distinct ones).
The product of its (nonzero) digits is 6804, while the sum is 33.
The spelling of 20690097000 in words is "twenty billion, six hundred ninety million, ninety-seven thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •