Base | Representation |
---|---|
bin | 1111100010001… |
… | …00101001110001 |
3 | 100002012011100020 |
4 | 13301010221301 |
5 | 231324222000 |
6 | 20532514053 |
7 | 3141366603 |
oct | 761045161 |
9 | 302164306 |
10 | 130304625 |
11 | 6760a880 |
12 | 3777b929 |
13 | 20cc4339 |
14 | 1343d173 |
15 | b68dba0 |
hex | 7c44a71 |
130304625 has 64 divisors (see below), whose sum is σ = 244408320. Its totient is φ = 61080000.
The previous prime is 130304623. The next prime is 130304653. The reversal of 130304625 is 526403031.
It is a happy number.
It is not a de Polignac number, because 130304625 - 21 = 130304623 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 130304595 and 130304604.
It is not an unprimeable number, because it can be changed into a prime (130304621) 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 63 ways as a sum of consecutive naturals, for example, 127366 + ... + 128384.
It is an arithmetic number, because the mean of its divisors is an integer number (3818880).
Almost surely, 2130304625 is an apocalyptic number.
130304625 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
130304625 is a deficient number, since it is larger than the sum of its proper divisors (114103695).
130304625 is a wasteful number, since it uses less digits than its factorization.
130304625 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1079 (or 1069 counting only the distinct ones).
The product of its (nonzero) digits is 2160, while the sum is 24.
The square root of 130304625 is about 11415.1051243517. The cubic root of 130304625 is about 506.9750774564.
Adding to 130304625 its reverse (526403031), we get a palindrome (656707656).
The spelling of 130304625 in words is "one hundred thirty million, three hundred four thousand, six hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •