Base | Representation |
---|---|
bin | 1001011000011100111101… |
… | …01000000100000000000000 |
3 | 2201001100012222200101220101 |
4 | 10230032132220010000000 |
5 | 10201011041120144320 |
6 | 111513532424252144 |
7 | 4226366025623203 |
oct | 454163650040000 |
9 | 81040188611811 |
10 | 20631389224960 |
11 | 66347a53a3968 |
12 | 2392602611054 |
13 | b686bb081527 |
14 | 5147c925593a |
15 | 25ba0a794c0a |
hex | 12c39ea04000 |
20631389224960 has 240 divisors, whose sum is σ = 52459704864000. Its totient is φ = 7762178211840.
The previous prime is 20631389224843. The next prime is 20631389224997. The reversal of 20631389224960 is 6942298313602.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2783883655 + ... + 2783891065.
It is an arithmetic number, because the mean of its divisors is an integer number (218582103600).
Almost surely, 220631389224960 is an apocalyptic number.
20631389224960 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 20631389224960, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (26229852432000).
20631389224960 is an abundant number, since it is smaller than the sum of its proper divisors (31828315639040).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20631389224960 is an equidigital number, since it uses as much as digits as its factorization.
20631389224960 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9460 (or 9434 counting only the distinct ones).
The product of its (nonzero) digits is 6718464, while the sum is 55.
The spelling of 20631389224960 in words is "twenty trillion, six hundred thirty-one billion, three hundred eighty-nine million, two hundred twenty-four thousand, nine hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •