Base | Representation |
---|---|
bin | 1111100011011… |
… | …11100101101001 |
3 | 100002112002120201 |
4 | 13301233211221 |
5 | 231400333424 |
6 | 20540352201 |
7 | 3143031406 |
oct | 761574551 |
9 | 302462521 |
10 | 130480489 |
11 | 6771aa17 |
12 | 37845661 |
13 | 210563b9 |
14 | 134872ad |
15 | b6c5d44 |
hex | 7c6f969 |
130480489 has 2 divisors, whose sum is σ = 130480490. Its totient is φ = 130480488.
The previous prime is 130480487. The next prime is 130480499. The reversal of 130480489 is 984084031.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 110944089 + 19536400 = 10533^2 + 4420^2 .
It is a cyclic number.
It is not a de Polignac number, because 130480489 - 21 = 130480487 is a prime.
Together with 130480487, it forms a pair of twin primes.
It is equal to p7403797 and since 130480489 and 7403797 have the same sum of digits, it is a Honaker prime.
It is not a weakly prime, because it can be changed into another prime (130480481) 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 as a sum of consecutive naturals, namely, 65240244 + 65240245.
It is an arithmetic number, because the mean of its divisors is an integer number (65240245).
Almost surely, 2130480489 is an apocalyptic number.
It is an amenable number.
130480489 is a deficient number, since it is larger than the sum of its proper divisors (1).
130480489 is an equidigital number, since it uses as much as digits as its factorization.
130480489 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 27648, while the sum is 37.
The square root of 130480489 is about 11422.8056536037. The cubic root of 130480489 is about 507.2030524405.
The spelling of 130480489 in words is "one hundred thirty million, four hundred eighty thousand, four hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •