Base | Representation |
---|---|
bin | 10000010101001000110011… |
… | …101101111101100000010010 |
3 | 100102022001100122020020222100 |
4 | 100111020303231331200102 |
5 | 33403210021031411010 |
6 | 412430131003021230 |
7 | 21061630015053630 |
oct | 2025106355754022 |
9 | 312261318206870 |
10 | 71821310810130 |
11 | 20980279635892 |
12 | 807b54b80a816 |
13 | 310c94a07801b |
14 | 13a4254652350 |
15 | 8483853e32c0 |
hex | 415233b7d812 |
71821310810130 has 192 divisors, whose sum is σ = 215764218109440. Its totient is φ = 16235766448128.
The previous prime is 71821310810113. The next prime is 71821310810141. The reversal of 71821310810130 is 3101801312817.
It is a Curzon number.
It is an unprimeable number.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 49180764 + ... + 50620056.
It is an arithmetic number, because the mean of its divisors is an integer number (1123771969320).
Almost surely, 271821310810130 is an apocalyptic number.
71821310810130 is a gapful number since it is divisible by the number (70) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 71821310810130, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (107882109054720).
71821310810130 is an abundant number, since it is smaller than the sum of its proper divisors (143942907299310).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
71821310810130 is a wasteful number, since it uses less digits than its factorization.
71821310810130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1440185 (or 1440182 counting only the distinct ones).
The product of its (nonzero) digits is 8064, while the sum is 36.
The spelling of 71821310810130 in words is "seventy-one trillion, eight hundred twenty-one billion, three hundred ten million, eight hundred ten thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •