Base | Representation |
---|---|
bin | 1001010000001101000001… |
… | …10011011100101001000000 |
3 | 2200001020122011200102010211 |
4 | 10220012200303130221000 |
5 | 10131340104212003433 |
6 | 111135420044003504 |
7 | 4200043236405016 |
oct | 450064063345100 |
9 | 80036564612124 |
10 | 20347957922368 |
11 | 653557a86021a |
12 | 23476a1b30594 |
13 | b47a5ba948ab |
14 | 504bbc8008b6 |
15 | 25446c9b48cd |
hex | 1281a0cdca40 |
20347957922368 has 112 divisors (see below), whose sum is σ = 42911290920960. Its totient is φ = 9561091244544.
The previous prime is 20347957922359. The next prime is 20347957922419. The reversal of 20347957922368 is 86322975974302.
It is a super-2 number, since 2×203479579223682 (a number of 27 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 6298105 + ... + 8964487.
It is an arithmetic number, because the mean of its divisors is an integer number (383136526080).
Almost surely, 220347957922368 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 20347957922368, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (21455645460480).
20347957922368 is an abundant number, since it is smaller than the sum of its proper divisors (22563332998592).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20347957922368 is a wasteful number, since it uses less digits than its factorization.
20347957922368 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2666544 (or 2666534 counting only the distinct ones).
The product of its (nonzero) digits is 274337280, while the sum is 67.
The spelling of 20347957922368 in words is "twenty trillion, three hundred forty-seven billion, nine hundred fifty-seven million, nine hundred twenty-two thousand, three hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •