Base | Representation |
---|---|
bin | 10011000011110111… |
… | …111001110011101000 |
3 | 1221211022112122012000 |
4 | 103003313321303220 |
5 | 313403304043000 |
6 | 13222455051000 |
7 | 1323111550431 |
oct | 230367716350 |
9 | 57738478160 |
10 | 20466081000 |
11 | 8752629632 |
12 | 3b72070a60 |
13 | 1c12115001 |
14 | dc216c488 |
15 | 7ebb34000 |
hex | 4c3df9ce8 |
20466081000 has 128 divisors (see below), whose sum is σ = 70949174400. Its totient is φ = 5457614400.
The previous prime is 20466080981. The next prime is 20466081019. The reversal of 20466081000 is 18066402.
20466081000 is a `hidden beast` number, since 2 + 0 + 46 + 608 + 10 + 0 + 0 = 666.
It is an interprime number because it is at equal distance from previous prime (20466080981) and next prime (20466081019).
It is a super-2 number, since 2×204660810002 (a number of 21 digits) contains 22 as substring.
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 31 ways as a sum of consecutive naturals, for example, 352002 + ... + 406001.
It is an arithmetic number, because the mean of its divisors is an integer number (554290425).
Almost surely, 220466081000 is an apocalyptic number.
20466081000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
20466081000 is an abundant number, since it is smaller than the sum of its proper divisors (50483093400).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20466081000 is a wasteful number, since it uses less digits than its factorization.
20466081000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 758033 (or 758013 counting only the distinct ones).
The product of its (nonzero) digits is 2304, while the sum is 27.
The spelling of 20466081000 in words is "twenty billion, four hundred sixty-six million, eighty-one thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •