Base | Representation |
---|---|
bin | 111100101110100101… |
… | …1010001001110101101 |
3 | 110110121122122220222010 |
4 | 1321131023101032231 |
5 | 4114041014113000 |
6 | 135524403111433 |
7 | 12264510604266 |
oct | 1713513211655 |
9 | 413548586863 |
10 | 130412254125 |
11 | 5034235481a |
12 | 21336972579 |
13 | c3b441699a |
14 | 645213d96d |
15 | 35d4147d50 |
hex | 1e5d2d13ad |
130412254125 has 32 divisors (see below), whose sum is σ = 217209657600. Its totient is φ = 69487924800.
The previous prime is 130412254121. The next prime is 130412254187. The reversal of 130412254125 is 521452214031.
It is not a de Polignac number, because 130412254125 - 22 = 130412254121 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 130412254092 and 130412254101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130412254121) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 238216 + ... + 563534.
It is an arithmetic number, because the mean of its divisors is an integer number (6787801800).
Almost surely, 2130412254125 is an apocalyptic number.
130412254125 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
130412254125 is a deficient number, since it is larger than the sum of its proper divisors (86797403475).
130412254125 is a wasteful number, since it uses less digits than its factorization.
130412254125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 326406 (or 326396 counting only the distinct ones).
The product of its (nonzero) digits is 9600, while the sum is 30.
Adding to 130412254125 its reverse (521452214031), we get a palindrome (651864468156).
The spelling of 130412254125 in words is "one hundred thirty billion, four hundred twelve million, two hundred fifty-four thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •