Base | Representation |
---|---|
bin | 1001000110001110101110… |
… | …10010100100000010011100 |
3 | 2121211111002222200020221000 |
4 | 10203013113102210002130 |
5 | 10110231300303240431 |
6 | 110314144000310300 |
7 | 4133222232650166 |
oct | 443072722440234 |
9 | 77744088606830 |
10 | 20005274665116 |
11 | 641320a015004 |
12 | 22b11a6012390 |
13 | b2164900c960 |
14 | 4d23909b9936 |
15 | 24a5b2e949e6 |
hex | 1231d74a409c |
20005274665116 has 48 divisors (see below), whose sum is σ = 55855182829600. Its totient is φ = 6155469127296.
The previous prime is 20005274665091. The next prime is 20005274665217. The reversal of 20005274665116 is 61156647250002.
20005274665116 is a `hidden beast` number, since 2 + 0 + 0 + 0 + 5 + 2 + 74 + 66 + 511 + 6 = 666.
It is a super-2 number, since 2×200052746651162 (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 (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 7124384161 + ... + 7124386968.
Almost surely, 220005274665116 is an apocalyptic number.
20005274665116 is a gapful number since it is divisible by the number (26) formed by its first and last digit.
It is an amenable number.
20005274665116 is an abundant number, since it is smaller than the sum of its proper divisors (35849908164484).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20005274665116 is a wasteful number, since it uses less digits than its factorization.
20005274665116 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14248771155 (or 14248771147 counting only the distinct ones).
The product of its (nonzero) digits is 604800, while the sum is 45.
The spelling of 20005274665116 in words is "twenty trillion, five billion, two hundred seventy-four million, six hundred sixty-five thousand, one hundred sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •