Base | Representation |
---|---|
bin | 1001010010011110001011… |
… | …10101000100101000000000 |
3 | 2200022200210021211210010000 |
4 | 10221033011311010220000 |
5 | 10134124204430012413 |
6 | 111235305035040000 |
7 | 4205502362464461 |
oct | 451170565045000 |
9 | 80280707753100 |
10 | 20425888516608 |
11 | 6565630625103 |
12 | 235a8108a0000 |
13 | b521cb261153 |
14 | 5088927b4d68 |
15 | 2564ce461073 |
hex | 1293c5d44a00 |
20425888516608 has 800 divisors, whose sum is σ = 66389833635840. Its totient is φ = 6228553605120.
The previous prime is 20425888516489. The next prime is 20425888516669. The reversal of 20425888516608 is 80661588852402.
20425888516608 is a `hidden beast` number, since 2 + 0 + 4 + 2 + 5 + 8 + 8 + 8 + 5 + 16 + 608 = 666.
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 79 ways as a sum of consecutive naturals, for example, 21569047591 + ... + 21569048537.
Almost surely, 220425888516608 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 20425888516608, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (33194916817920).
20425888516608 is an abundant number, since it is smaller than the sum of its proper divisors (45963945119232).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20425888516608 is an equidigital number, since it uses as much as digits as its factorization.
20425888516608 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1910 (or 1885 counting only the distinct ones).
The product of its (nonzero) digits is 58982400, while the sum is 63.
The spelling of 20425888516608 in words is "twenty trillion, four hundred twenty-five billion, eight hundred eighty-eight million, five hundred sixteen thousand, six hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •