Base | Representation |
---|---|
bin | 1001100010001110101110… |
… | …10111000111111000010100 |
3 | 2202020110101120101122022000 |
4 | 10301013113113013320110 |
5 | 10222012112211103204 |
6 | 112332133354235300 |
7 | 4262561304631560 |
oct | 461072727077024 |
9 | 82213346348260 |
10 | 20967348534804 |
11 | 67542256a2951 |
12 | 2427742725b30 |
13 | b9129ba95269 |
14 | 526b7a05c6a0 |
15 | 26561ed29039 |
hex | 1311d75c7e14 |
20967348534804 has 48 divisors (see below), whose sum is σ = 62125477142400. Its totient is φ = 5990671009728.
The previous prime is 20967348534799. The next prime is 20967348534827. The reversal of 20967348534804 is 40843584376902.
20967348534804 is a `hidden beast` number, since 2 + 0 + 9 + 6 + 73 + 4 + 85 + 3 + 480 + 4 = 666.
It is a Harshad number since it is a multiple of its sum of digits (63).
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 15 ways as a sum of consecutive naturals, for example, 13867293249 + ... + 13867294760.
It is an arithmetic number, because the mean of its divisors is an integer number (1294280773800).
Almost surely, 220967348534804 is an apocalyptic number.
It is an amenable number.
20967348534804 is an abundant number, since it is smaller than the sum of its proper divisors (41158128607596).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20967348534804 is a wasteful number, since it uses less digits than its factorization.
20967348534804 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27734588029 (or 27734588021 counting only the distinct ones).
The product of its (nonzero) digits is 139345920, while the sum is 63.
The spelling of 20967348534804 in words is "twenty trillion, nine hundred sixty-seven billion, three hundred forty-eight million, five hundred thirty-four thousand, eight hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •