Base | Representation |
---|---|
bin | 1001001001101110101101… |
… | …11001011110000001011000 |
3 | 2122020222111120222111121011 |
4 | 10210313112321132001120 |
5 | 10114214034423434120 |
6 | 110445312313023304 |
7 | 4145010216252625 |
oct | 444672671360130 |
9 | 78228446874534 |
10 | 20125527171160 |
11 | 645a208464704 |
12 | 23105663b4b34 |
13 | b2caa1606288 |
14 | 4d811b69134c |
15 | 24d7a01c6c5a |
hex | 124dd6e5e058 |
20125527171160 has 128 divisors (see below), whose sum is σ = 48126962980800. Its totient is φ = 7548134031360.
The previous prime is 20125527171137. The next prime is 20125527171203. The reversal of 20125527171160 is 6117172552102.
It is a Harshad number since it is a multiple of its sum of digits (40).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 235588855 + ... + 235674265.
Almost surely, 220125527171160 is an apocalyptic number.
20125527171160 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 20125527171160, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (24063481490400).
20125527171160 is an abundant number, since it is smaller than the sum of its proper divisors (28001435809640).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20125527171160 is a wasteful number, since it uses less digits than its factorization.
20125527171160 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 86741 (or 86737 counting only the distinct ones).
The product of its (nonzero) digits is 58800, while the sum is 40.
The spelling of 20125527171160 in words is "twenty trillion, one hundred twenty-five billion, five hundred twenty-seven million, one hundred seventy-one thousand, one hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •