Base | Representation |
---|---|
bin | 1111100010111… |
… | …00100011111101 |
3 | 100002101010200100 |
4 | 13301130203331 |
5 | 231340340212 |
6 | 20534551313 |
7 | 3142255245 |
oct | 761344375 |
9 | 302333610 |
10 | 130402557 |
11 | 6767740a |
12 | 37808539 |
13 | 21029a9c |
14 | 13466b25 |
15 | b6acbdc |
hex | 7c5c8fd |
130402557 has 6 divisors (see below), whose sum is σ = 188359262. Its totient is φ = 86935032.
The previous prime is 130402553. The next prime is 130402579. The reversal of 130402557 is 755204031.
It is a happy number.
It can be written as a sum of positive squares in only one way, i.e., 128799801 + 1602756 = 11349^2 + 1266^2 .
It is not a de Polignac number, because 130402557 - 22 = 130402553 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 130402557.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130402553) 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 5 ways as a sum of consecutive naturals, for example, 7244578 + ... + 7244595.
Almost surely, 2130402557 is an apocalyptic number.
It is an amenable number.
130402557 is a deficient number, since it is larger than the sum of its proper divisors (57956705).
130402557 is a wasteful number, since it uses less digits than its factorization.
130402557 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14489179 (or 14489176 counting only the distinct ones).
The product of its (nonzero) digits is 4200, while the sum is 27.
The square root of 130402557 is about 11419.3938981016. The cubic root of 130402557 is about 507.1020533801.
Adding to 130402557 its reverse (755204031), we get a palindrome (885606588).
The spelling of 130402557 in words is "one hundred thirty million, four hundred two thousand, five hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •