Base | Representation |
---|---|
bin | 111100101011111101… |
… | …1110101000011001101 |
3 | 110110101112012102122202 |
4 | 1321113323311003031 |
5 | 4113401011223321 |
6 | 135511542251245 |
7 | 12262362306026 |
oct | 1712773650315 |
9 | 413345172582 |
10 | 130324320461 |
11 | 502a7754975 |
12 | 21311426b25 |
13 | c39c13942a |
14 | 64445adc4d |
15 | 35cb57870b |
hex | 1e57ef50cd |
130324320461 has 2 divisors, whose sum is σ = 130324320462. Its totient is φ = 130324320460.
The previous prime is 130324320457. The next prime is 130324320463. The reversal of 130324320461 is 164023423031.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 127685443561 + 2638876900 = 357331^2 + 51370^2 .
It is a cyclic number.
It is not a de Polignac number, because 130324320461 - 22 = 130324320457 is a prime.
Together with 130324320463, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (130324320463) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65162160230 + 65162160231.
It is an arithmetic number, because the mean of its divisors is an integer number (65162160231).
Almost surely, 2130324320461 is an apocalyptic number.
It is an amenable number.
130324320461 is a deficient number, since it is larger than the sum of its proper divisors (1).
130324320461 is an equidigital number, since it uses as much as digits as its factorization.
130324320461 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10368, while the sum is 29.
Adding to 130324320461 its reverse (164023423031), we get a palindrome (294347743492).
The spelling of 130324320461 in words is "one hundred thirty billion, three hundred twenty-four million, three hundred twenty thousand, four hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •