Base | Representation |
---|---|
bin | 1111100000001… |
… | …10010100101101 |
3 | 100001201012010200 |
4 | 13300012110231 |
5 | 231243034300 |
6 | 20523224113 |
7 | 3136254360 |
oct | 760062455 |
9 | 301635120 |
10 | 130049325 |
11 | 67455a8a |
12 | 37678039 |
13 | 20c35083 |
14 | 133b40d7 |
15 | b63d200 |
hex | 7c0652d |
130049325 has 36 divisors (see below), whose sum is σ = 266212128. Its totient is φ = 59450400.
The previous prime is 130049323. The next prime is 130049399. The reversal of 130049325 is 523940031.
It is not a de Polignac number, because 130049325 - 21 = 130049323 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130049323) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 39711 + ... + 42860.
Almost surely, 2130049325 is an apocalyptic number.
130049325 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
130049325 is an abundant number, since it is smaller than the sum of its proper divisors (136162803).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130049325 is a wasteful number, since it uses less digits than its factorization.
130049325 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 82594 (or 82586 counting only the distinct ones).
The product of its (nonzero) digits is 3240, while the sum is 27.
The square root of 130049325 is about 11403.9170901932. The cubic root of 130049325 is about 506.6437631517.
Adding to 130049325 its reverse (523940031), we get a palindrome (653989356).
It can be divided in two parts, 1300 and 49325, that added together give a 4-th power (50625 = 154).
The spelling of 130049325 in words is "one hundred thirty million, forty-nine thousand, three hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •