Base | Representation |
---|---|
bin | 1111100100000… |
… | …00111010000001 |
3 | 100002122200212222 |
4 | 13302000322001 |
5 | 231410121200 |
6 | 20542100425 |
7 | 3143445254 |
oct | 762007201 |
9 | 302580788 |
10 | 130551425 |
11 | 67769244 |
12 | 3787a715 |
13 | 2107c784 |
14 | 134a509b |
15 | b6dbd85 |
hex | 7c80e81 |
130551425 has 6 divisors (see below), whose sum is σ = 161883798. Its totient is φ = 104441120.
The previous prime is 130551419. The next prime is 130551431. The reversal of 130551425 is 524155031.
It is an interprime number because it is at equal distance from previous prime (130551419) and next prime (130551431).
It can be written as a sum of positive squares in 3 ways, for example, as 15547249 + 115004176 = 3943^2 + 10724^2 .
It is not a de Polignac number, because 130551425 - 24 = 130551409 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 130551394 and 130551403.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 2611004 + ... + 2611053.
It is an arithmetic number, because the mean of its divisors is an integer number (26980633).
Almost surely, 2130551425 is an apocalyptic number.
It is an amenable number.
130551425 is a deficient number, since it is larger than the sum of its proper divisors (31332373).
130551425 is an equidigital number, since it uses as much as digits as its factorization.
130551425 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5222067 (or 5222062 counting only the distinct ones).
The product of its (nonzero) digits is 3000, while the sum is 26.
The square root of 130551425 is about 11425.9102482034. The cubic root of 130551425 is about 507.2949498012.
The spelling of 130551425 in words is "one hundred thirty million, five hundred fifty-one thousand, four hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •