Base | Representation |
---|---|
bin | 1111100011110… |
… | …01110110011101 |
3 | 100002121020020121 |
4 | 13301321312131 |
5 | 231403210100 |
6 | 20541314541 |
7 | 3143265100 |
oct | 761716635 |
9 | 302536217 |
10 | 130522525 |
11 | 67749561 |
12 | 37865a51 |
13 | 2106c583 |
14 | 13498737 |
15 | b6d351a |
hex | 7c79d9d |
130522525 has 36 divisors (see below), whose sum is σ = 192362688. Its totient is φ = 87558240.
The previous prime is 130522523. The next prime is 130522537. The reversal of 130522525 is 525225031.
It is a happy number.
It is not a de Polignac number, because 130522525 - 21 = 130522523 is a prime.
It is a super-2 number, since 2×1305225252 = 34072259064751250, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (25).
It is a self number, because there is not a number n which added to its sum of digits gives 130522525.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130522523) by changing a digit.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 56442 + ... + 58708.
It is an arithmetic number, because the mean of its divisors is an integer number (5343408).
Almost surely, 2130522525 is an apocalyptic number.
It is an amenable number.
130522525 is a deficient number, since it is larger than the sum of its proper divisors (61840163).
130522525 is a wasteful number, since it uses less digits than its factorization.
130522525 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2338 (or 2326 counting only the distinct ones).
The product of its (nonzero) digits is 3000, while the sum is 25.
The square root of 130522525 is about 11424.6455087237. The cubic root of 130522525 is about 507.2575139632.
Adding to 130522525 its reverse (525225031), we get a palindrome (655747556).
The spelling of 130522525 in words is "one hundred thirty million, five hundred twenty-two thousand, five hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •