Base | Representation |
---|---|
bin | 1001010110100001101111… |
… | …10101000010000010010100 |
3 | 2200211000110221100202111120 |
4 | 10223100313311002002110 |
5 | 10143420102423441400 |
6 | 111423312454203540 |
7 | 4221534551205036 |
oct | 453206765020224 |
9 | 80730427322446 |
10 | 20565240062100 |
11 | 660973a975828 |
12 | 23818213535b0 |
13 | b623a8690746 |
14 | 511511c45c56 |
15 | 259e38292ca0 |
hex | 12b437d42094 |
20565240062100 has 144 divisors (see below), whose sum is σ = 62770845950400. Its totient is φ = 5184059857920.
The previous prime is 20565240062077. The next prime is 20565240062111. The reversal of 20565240062100 is 126004256502.
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 47 ways as a sum of consecutive naturals, for example, 1342515 + ... + 6552314.
Almost surely, 220565240062100 is an apocalyptic number.
20565240062100 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 20565240062100, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (31385422975200).
20565240062100 is an abundant number, since it is smaller than the sum of its proper divisors (42205605888300).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20565240062100 is a wasteful number, since it uses less digits than its factorization.
20565240062100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7895322 (or 7895315 counting only the distinct ones).
The product of its (nonzero) digits is 28800, while the sum is 33.
The spelling of 20565240062100 in words is "twenty trillion, five hundred sixty-five billion, two hundred forty million, sixty-two thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •