Base | Representation |
---|---|
bin | 1111100011101… |
… | …10101001011101 |
3 | 100002120120020200 |
4 | 13301312221131 |
5 | 231402300110 |
6 | 20541134113 |
7 | 3143211615 |
oct | 761665135 |
9 | 302516220 |
10 | 130509405 |
11 | 6773a714 |
12 | 3785a339 |
13 | 21066600 |
14 | 13493a45 |
15 | b6ce6c0 |
hex | 7c76a5d |
130509405 has 54 divisors (see below), whose sum is σ = 246840282. Its totient is φ = 63760320.
The previous prime is 130509403. The next prime is 130509409. The reversal of 130509405 is 504905031.
It can be written as a sum of positive squares in 3 ways, for example, as 617796 + 129891609 = 786^2 + 11397^2 .
It is not a de Polignac number, because 130509405 - 21 = 130509403 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130509403) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 53 ways as a sum of consecutive naturals, for example, 996190 + ... + 996320.
Almost surely, 2130509405 is an apocalyptic number.
130509405 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
130509405 is a deficient number, since it is larger than the sum of its proper divisors (116330877).
130509405 is a wasteful number, since it uses less digits than its factorization.
130509405 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 299 (or 152 counting only the distinct ones).
The product of its (nonzero) digits is 2700, while the sum is 27.
The square root of 130509405 is about 11424.0712970464. The cubic root of 130509405 is about 507.2405170462.
The spelling of 130509405 in words is "one hundred thirty million, five hundred nine thousand, four hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •