Base | Representation |
---|---|
bin | 1001001001101110110111… |
… | …00001011100111011101000 |
3 | 2122020222200222222111021210 |
4 | 10210313123201130323220 |
5 | 10114214214304330240 |
6 | 110445324124033120 |
7 | 4145012150621202 |
oct | 444673341347350 |
9 | 78228628874253 |
10 | 20125604761320 |
11 | 645a24823a303 |
12 | 23105883927a0 |
13 | b2cab4701806 |
14 | 4d8127acb772 |
15 | 24d7a6e01780 |
hex | 124ddb85cee8 |
20125604761320 has 128 divisors (see below), whose sum is σ = 62533049760000. Its totient is φ = 5181764150528.
The previous prime is 20125604761289. The next prime is 20125604761331. The reversal of 20125604761320 is 2316740652102.
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, 511620 + ... + 6364979.
It is an arithmetic number, because the mean of its divisors is an integer number (488539451250).
Almost surely, 220125604761320 is an apocalyptic number.
20125604761320 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 20125604761320, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (31266524880000).
20125604761320 is an abundant number, since it is smaller than the sum of its proper divisors (42407444998680).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20125604761320 is an equidigital number, since it uses as much as digits as its factorization.
20125604761320 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6876700 (or 6876638 counting only the distinct ones).
The product of its (nonzero) digits is 120960, while the sum is 39.
The spelling of 20125604761320 in words is "twenty trillion, one hundred twenty-five billion, six hundred four million, seven hundred sixty-one thousand, three hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •