Base | Representation |
---|---|
bin | 111100100011100100… |
… | …0111001001001001001 |
3 | 110102122212222010010211 |
4 | 1321013020321021021 |
5 | 4112311342014200 |
6 | 135423554441121 |
7 | 12252401200411 |
oct | 1710710711111 |
9 | 412585863124 |
10 | 130042532425 |
11 | 5017268a3a3 |
12 | 21252b931a1 |
13 | c355946c50 |
14 | 6418dbb641 |
15 | 35b1965aba |
hex | 1e47239249 |
130042532425 has 12 divisors (see below), whose sum is σ = 173656797580. Its totient is φ = 96031408320.
The previous prime is 130042532413. The next prime is 130042532437. The reversal of 130042532425 is 524235240031.
It is an interprime number because it is at equal distance from previous prime (130042532413) and next prime (130042532437).
It can be written as a sum of positive squares in 6 ways, for example, as 868421961 + 129174110464 = 29469^2 + 359408^2 .
It is not a de Polignac number, because 130042532425 - 27 = 130042532297 is a prime.
It is a super-2 number, since 2×1300425324252 (a number of 23 digits) contains 22 as substring.
It is an unprimeable number.
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 11 ways as a sum of consecutive naturals, for example, 200065110 + ... + 200065759.
Almost surely, 2130042532425 is an apocalyptic number.
It is an amenable number.
130042532425 is a deficient number, since it is larger than the sum of its proper divisors (43614265155).
130042532425 is a wasteful number, since it uses less digits than its factorization.
130042532425 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 400130892 (or 400130887 counting only the distinct ones).
The product of its (nonzero) digits is 28800, while the sum is 31.
Adding to 130042532425 its reverse (524235240031), we get a palindrome (654277772456).
The spelling of 130042532425 in words is "one hundred thirty billion, forty-two million, five hundred thirty-two thousand, four hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •