Base | Representation |
---|---|
bin | 1111100001101… |
… | …10110001111101 |
3 | 100002002021101210 |
4 | 13300312301331 |
5 | 231320412210 |
6 | 20531355033 |
7 | 3141042132 |
oct | 760666175 |
9 | 302067353 |
10 | 130247805 |
11 | 67581116 |
12 | 37752a79 |
13 | 20ca450c |
14 | 13426589 |
15 | b67be20 |
hex | 7c36c7d |
130247805 has 8 divisors (see below), whose sum is σ = 208396512. Its totient is φ = 69465488.
The previous prime is 130247801. The next prime is 130247891. The reversal of 130247805 is 508742031.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 130247805 - 22 = 130247801 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130247801) 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 7 ways as a sum of consecutive naturals, for example, 4341579 + ... + 4341608.
It is an arithmetic number, because the mean of its divisors is an integer number (26049564).
Almost surely, 2130247805 is an apocalyptic number.
130247805 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
130247805 is a deficient number, since it is larger than the sum of its proper divisors (78148707).
130247805 is an equidigital number, since it uses as much as digits as its factorization.
130247805 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8683195.
The product of its (nonzero) digits is 6720, while the sum is 30.
The square root of 130247805 is about 11412.6160454122. The cubic root of 130247805 is about 506.9013770487.
Adding to 130247805 its reverse (508742031), we get a palindrome (638989836).
The spelling of 130247805 in words is "one hundred thirty million, two hundred forty-seven thousand, eight hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •