Base | Representation |
---|---|
bin | 111100110111011111… |
… | …0101101100110000000 |
3 | 110111101110201100212020 |
4 | 1321232332231212000 |
5 | 4120144000433240 |
6 | 140014153201440 |
7 | 12305065522434 |
oct | 1715676554600 |
9 | 414343640766 |
10 | 130710952320 |
11 | 50485a1a133 |
12 | 213baa00280 |
13 | c43127a090 |
14 | 647da949c4 |
15 | 360049b0d0 |
hex | 1e6efad980 |
130710952320 has 256 divisors, whose sum is σ = 449082809280. Its totient is φ = 32146882560.
The previous prime is 130710952301. The next prime is 130710952321. The reversal of 130710952320 is 23259017031.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130710952321) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 55834350 + ... + 55836690.
Almost surely, 2130710952320 is an apocalyptic number.
130710952320 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 130710952320, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (224541404640).
130710952320 is an abundant number, since it is smaller than the sum of its proper divisors (318371856960).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130710952320 is a wasteful number, since it uses less digits than its factorization.
130710952320 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4613 (or 4601 counting only the distinct ones).
The product of its (nonzero) digits is 11340, while the sum is 33.
Adding to 130710952320 its reverse (23259017031), we get a palindrome (153969969351).
The spelling of 130710952320 in words is "one hundred thirty billion, seven hundred ten million, nine hundred fifty-two thousand, three hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •