Base | Representation |
---|---|
bin | 111100101111001000… |
… | …0000111110100010101 |
3 | 110110122220121221001211 |
4 | 1321132100013310111 |
5 | 4114110124203014 |
6 | 135530250021421 |
7 | 12265120200352 |
oct | 1713620076425 |
9 | 413586557054 |
10 | 130430303509 |
11 | 50351562570 |
12 | 21340a17871 |
13 | c3b80962ac |
14 | 64546bb629 |
15 | 35d5a10cc4 |
hex | 1e5e407d15 |
130430303509 has 4 divisors (see below), whose sum is σ = 142287603840. Its totient is φ = 118573003180.
The previous prime is 130430303483. The next prime is 130430303533. The reversal of 130430303509 is 905303034031.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 905303034031 = 11 ⋅82300275821.
It is a cyclic number.
It is not a de Polignac number, because 130430303509 - 25 = 130430303477 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130430303009) 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 3 ways as a sum of consecutive naturals, for example, 5928650149 + ... + 5928650170.
It is an arithmetic number, because the mean of its divisors is an integer number (35571900960).
Almost surely, 2130430303509 is an apocalyptic number.
It is an amenable number.
130430303509 is a deficient number, since it is larger than the sum of its proper divisors (11857300331).
130430303509 is a wasteful number, since it uses less digits than its factorization.
130430303509 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11857300330.
The product of its (nonzero) digits is 14580, while the sum is 31.
The spelling of 130430303509 in words is "one hundred thirty billion, four hundred thirty million, three hundred three thousand, five hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •