Base | Representation |
---|---|
bin | 111100110000000010… |
… | …1001010110010011000 |
3 | 110110202001100210020122 |
4 | 1321200011022302120 |
5 | 4114141003032040 |
6 | 135533303412412 |
7 | 12265642042244 |
oct | 1714005126230 |
9 | 413661323218 |
10 | 130460986520 |
11 | 5036790a127 |
12 | 2134b154108 |
13 | c3c154a117 |
14 | 64587c7424 |
15 | 35d85721b5 |
hex | 1e6014ac98 |
130460986520 has 64 divisors (see below), whose sum is σ = 304133356800. Its totient is φ = 50313162240.
The previous prime is 130460986519. The next prime is 130460986529. The reversal of 130460986520 is 25689064031.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130460986529) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 138002 + ... + 529118.
It is an arithmetic number, because the mean of its divisors is an integer number (4752083700).
Almost surely, 2130460986520 is an apocalyptic number.
130460986520 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 130460986520, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (152066678400).
130460986520 is an abundant number, since it is smaller than the sum of its proper divisors (173672370280).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130460986520 is a wasteful number, since it uses less digits than its factorization.
130460986520 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 391428 (or 391424 counting only the distinct ones).
The product of its (nonzero) digits is 311040, while the sum is 44.
The spelling of 130460986520 in words is "one hundred thirty billion, four hundred sixty million, nine hundred eighty-six thousand, five hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •