Base | Representation |
---|---|
bin | 1111100010111… |
… | …01110010001000 |
3 | 100002101101112122 |
4 | 13301131302020 |
5 | 231341020220 |
6 | 20535030412 |
7 | 3142305653 |
oct | 761356210 |
9 | 302341478 |
10 | 130407560 |
11 | 67680148 |
12 | 3780b408 |
13 | 2102c14a |
14 | 1346889a |
15 | b6ae425 |
hex | 7c5dc88 |
130407560 has 64 divisors (see below), whose sum is σ = 301806000. Its totient is φ = 50692096.
The previous prime is 130407551. The next prime is 130407601. The reversal of 130407560 is 65704031.
It can be written as a sum of positive squares in 8 ways, for example, as 83649316 + 46758244 = 9146^2 + 6838^2 .
It is a super-2 number, since 2×1304075602 = 34012263410307200, which contains 22 as substring.
It is a plaindrome in base 14.
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, 290216 + ... + 290664.
Almost surely, 2130407560 is an apocalyptic number.
130407560 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 130407560, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (150903000).
130407560 is an abundant number, since it is smaller than the sum of its proper divisors (171398440).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130407560 is a wasteful number, since it uses less digits than its factorization.
130407560 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 650 (or 646 counting only the distinct ones).
The product of its (nonzero) digits is 2520, while the sum is 26.
The square root of 130407560 is about 11419.6129531609. The cubic root of 130407560 is about 507.1085384245.
The spelling of 130407560 in words is "one hundred thirty million, four hundred seven thousand, five hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.111 sec. • engine limits •