Base | Representation |
---|---|
bin | 1111100101100… |
… | …11000000000000 |
3 | 100010001010100100 |
4 | 13302303000000 |
5 | 231433202413 |
6 | 20550322400 |
7 | 3145261413 |
oct | 762630000 |
9 | 303033310 |
10 | 130756608 |
11 | 67899414 |
12 | 37959400 |
13 | 21121c98 |
14 | 13519b7a |
15 | b72ca73 |
hex | 7cb3000 |
130756608 has 78 divisors (see below), whose sum is σ = 377801684. Its totient is φ = 43573248.
The previous prime is 130756603. The next prime is 130756627. The reversal of 130756608 is 806657031.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is not an unprimeable number, because it can be changed into a prime (130756603) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 35091 + ... + 38637.
Almost surely, 2130756608 is an apocalyptic number.
130756608 is a gapful number since it is divisible by the number (18) 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 130756608, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (188900842).
130756608 is an abundant number, since it is smaller than the sum of its proper divisors (247045076).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130756608 is an equidigital number, since it uses as much as digits as its factorization.
130756608 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3577 (or 3552 counting only the distinct ones).
The product of its (nonzero) digits is 30240, while the sum is 36.
The square root of 130756608 is about 11434.8855700440. The cubic root of 130756608 is about 507.5605764604.
It can be divided in two parts, 13075 and 6608, that added together give a 9-th power (19683 = 39).
The spelling of 130756608 in words is "one hundred thirty million, seven hundred fifty-six thousand, six hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •