Base | Representation |
---|---|
bin | 1001000110010000000111… |
… | …11110011101100110111100 |
3 | 2121211120001020101020112112 |
4 | 10203020003332131212330 |
5 | 10110234314214324440 |
6 | 110314350221153152 |
7 | 4133246635231421 |
oct | 443100376354674 |
9 | 77746036336475 |
10 | 20006024370620 |
11 | 6413564223932 |
12 | 22b13750bb7b8 |
13 | b21738433392 |
14 | 4d24223b1d48 |
15 | 24a608bd4965 |
hex | 123203f9d9bc |
20006024370620 has 24 divisors (see below), whose sum is σ = 42290880662688. Its totient is φ = 7949413656000.
The previous prime is 20006024370611. The next prime is 20006024370637. The reversal of 20006024370620 is 2607342060002.
It is a super-2 number, since 2×200060243706202 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3312252671 + ... + 3312258710.
It is an arithmetic number, because the mean of its divisors is an integer number (1762120027612).
Almost surely, 220006024370620 is an apocalyptic number.
20006024370620 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
20006024370620 is an abundant number, since it is smaller than the sum of its proper divisors (22284856292068).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20006024370620 is a wasteful number, since it uses less digits than its factorization.
20006024370620 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6624511541 (or 6624511539 counting only the distinct ones).
The product of its (nonzero) digits is 24192, while the sum is 32.
The spelling of 20006024370620 in words is "twenty trillion, six billion, twenty-four million, three hundred seventy thousand, six hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •