Base | Representation |
---|---|
bin | 1001001101110011011000… |
… | …0011101110100110100000 |
3 | 1022212200100201011122100220 |
4 | 2103130312003232212200 |
5 | 2312003320102020430 |
6 | 33314525240243040 |
7 | 2064031420456335 |
oct | 223346603564640 |
9 | 38780321148326 |
10 | 10132734798240 |
11 | 32572a56a758a |
12 | 1177960470480 |
13 | 5866887ab762 |
14 | 2705d98c898c |
15 | 128897e12110 |
hex | 937360ee9a0 |
10132734798240 has 384 divisors, whose sum is σ = 33433876224000. Its totient is φ = 2574669115392.
The previous prime is 10132734798227. The next prime is 10132734798271. The reversal of 10132734798240 is 4289743723101.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 3762618334 + ... + 3762621026.
It is an arithmetic number, because the mean of its divisors is an integer number (87067386000).
Almost surely, 210132734798240 is an apocalyptic number.
10132734798240 is a gapful number since it is divisible by the number (10) 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 10132734798240, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (16716938112000).
10132734798240 is an abundant number, since it is smaller than the sum of its proper divisors (23301141425760).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10132734798240 is a wasteful number, since it uses less digits than its factorization.
10132734798240 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3916 (or 3908 counting only the distinct ones).
The product of its (nonzero) digits is 2032128, while the sum is 51.
The spelling of 10132734798240 in words is "ten trillion, one hundred thirty-two billion, seven hundred thirty-four million, seven hundred ninety-eight thousand, two hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •