Base | Representation |
---|---|
bin | 1001100010011010111000… |
… | …01000100111000000000000 |
3 | 2202021002020010200121120120 |
4 | 10301031130020213000000 |
5 | 10222113441443122021 |
6 | 112335132514540240 |
7 | 4263212035351041 |
oct | 461153410470000 |
9 | 82232203617516 |
10 | 20973871067136 |
11 | 6756a7247aa39 |
12 | 2428a62b97680 |
13 | b91a9b1a5050 |
14 | 5271d840a8c8 |
15 | 2658a277b2c6 |
hex | 13135c227000 |
20973871067136 has 104 divisors (see below), whose sum is σ = 60225303211920. Its totient is φ = 6453498740736.
The previous prime is 20973871067129. The next prime is 20973871067153. The reversal of 20973871067136 is 63176017837902.
It is a tau number, because it is divible by the number of its divisors (104).
It is a super-2 number, since 2×209738710671362 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 20973871067136.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 65488641 + ... + 65808128.
Almost surely, 220973871067136 is an apocalyptic number.
20973871067136 is a gapful number since it is divisible by the number (26) formed by its first and last digit.
It is an amenable number.
20973871067136 is an abundant number, since it is smaller than the sum of its proper divisors (39251432144784).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20973871067136 is a wasteful number, since it uses less digits than its factorization.
20973871067136 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 131296809 (or 131296787 counting only the distinct ones).
The product of its (nonzero) digits is 16003008, while the sum is 60.
The spelling of 20973871067136 in words is "twenty trillion, nine hundred seventy-three billion, eight hundred seventy-one million, sixty-seven thousand, one hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •