Base | Representation |
---|---|
bin | 111100110010111000… |
… | …1101100000111000000 |
3 | 110110222201011120200020 |
4 | 1321211301230013000 |
5 | 4114334433342144 |
6 | 135550555453440 |
7 | 12301212210636 |
oct | 1714561540700 |
9 | 413881146606 |
10 | 130556543424 |
11 | 5040684647a |
12 | 21377157280 |
13 | c408296478 |
14 | 646737d356 |
15 | 35e1b4a419 |
hex | 1e65c6c1c0 |
130556543424 has 224 divisors, whose sum is σ = 373786456896. Its totient is φ = 40063795200.
The previous prime is 130556543423. The next prime is 130556543443. The reversal of 130556543424 is 424345655031.
It is a super-2 number, since 2×1305565434242 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130556543423) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 68676874 + ... + 68678774.
Almost surely, 2130556543424 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 130556543424, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (186893228448).
130556543424 is an abundant number, since it is smaller than the sum of its proper divisors (243229913472).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130556543424 is a wasteful number, since it uses less digits than its factorization.
130556543424 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2383 (or 2373 counting only the distinct ones).
The product of its (nonzero) digits is 864000, while the sum is 42.
The spelling of 130556543424 in words is "one hundred thirty billion, five hundred fifty-six million, five hundred forty-three thousand, four hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •