Base | Representation |
---|---|
bin | 1111100110111… |
… | …11011010011101 |
3 | 100010101100220000 |
4 | 13303133122131 |
5 | 232010013100 |
6 | 20554244513 |
7 | 3146646654 |
oct | 763373235 |
9 | 303340800 |
10 | 130938525 |
11 | 67a03063 |
12 | 37a26739 |
13 | 21186a23 |
14 | 1356619b |
15 | b766900 |
hex | 7cdf69d |
130938525 has 30 divisors (see below), whose sum is σ = 242547162. Its totient is φ = 69832800.
The previous prime is 130938503. The next prime is 130938527. The reversal of 130938525 is 525839031.
It can be written as a sum of positive squares in 3 ways, for example, as 910116 + 130028409 = 954^2 + 11403^2 .
It is not a de Polignac number, because 130938525 - 29 = 130938013 is a prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 130938525.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130938527) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 29 ways as a sum of consecutive naturals, for example, 30306 + ... + 34355.
Almost surely, 2130938525 is an apocalyptic number.
130938525 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
130938525 is a deficient number, since it is larger than the sum of its proper divisors (111608637).
130938525 is an equidigital number, since it uses as much as digits as its factorization.
130938525 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 64683 (or 64669 counting only the distinct ones).
The product of its (nonzero) digits is 32400, while the sum is 36.
The square root of 130938525 is about 11442.8372792765. The cubic root of 130938525 is about 507.7958510202.
The spelling of 130938525 in words is "one hundred thirty million, nine hundred thirty-eight thousand, five hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •