Base | Representation |
---|---|
bin | 1001000111111101011011… |
… | …11100110000110001101000 |
3 | 2122001011112011220221000201 |
4 | 10203332231330300301220 |
5 | 10112220011410021113 |
6 | 110401333435241544 |
7 | 4140425143203160 |
oct | 443765574606150 |
9 | 78034464827021 |
10 | 20064710626408 |
11 | 643643a076478 |
12 | 2300812ba92b4 |
13 | b2712b952716 |
14 | 4d51cc5a75a0 |
15 | 24bde0e2ecdd |
hex | 123fadf30c68 |
20064710626408 has 16 divisors (see below), whose sum is σ = 42995808485280. Its totient is φ = 8599161697008.
The previous prime is 20064710626403. The next prime is 20064710626459. The reversal of 20064710626408 is 80462601746002.
It is a happy number.
It is a super-2 number, since 2×200647106264082 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (20064710626403) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 179149201966 + ... + 179149202077.
It is an arithmetic number, because the mean of its divisors is an integer number (2687238030330).
Almost surely, 220064710626408 is an apocalyptic number.
20064710626408 is a gapful number since it is divisible by the number (28) formed by its first and last digit.
It is an amenable number.
20064710626408 is an abundant number, since it is smaller than the sum of its proper divisors (22931097858872).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20064710626408 is a wasteful number, since it uses less digits than its factorization.
20064710626408 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 358298404056 (or 358298404052 counting only the distinct ones).
The product of its (nonzero) digits is 774144, while the sum is 46.
The spelling of 20064710626408 in words is "twenty trillion, sixty-four billion, seven hundred ten million, six hundred twenty-six thousand, four hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •