Base | Representation |
---|---|
bin | 111100110010110100… |
… | …1001011100001001101 |
3 | 110110222112222020210211 |
4 | 1321211221023201031 |
5 | 4114333401002111 |
6 | 135550440002421 |
7 | 12301154230414 |
oct | 1714551134115 |
9 | 413875866724 |
10 | 130554312781 |
11 | 50405562572 |
12 | 21376460411 |
13 | c407995069 |
14 | 6466d5c47b |
15 | 35e1859521 |
hex | 1e65a4b84d |
130554312781 has 2 divisors, whose sum is σ = 130554312782. Its totient is φ = 130554312780.
The previous prime is 130554312523. The next prime is 130554312877. The reversal of 130554312781 is 187213455031.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 127616130756 + 2938182025 = 357234^2 + 54205^2 .
It is an emirp because it is prime and its reverse (187213455031) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 130554312781 - 233 = 121964378189 is a prime.
It is a super-2 number, since 2×1305543127812 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (130554312481) 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 as a sum of consecutive naturals, namely, 65277156390 + 65277156391.
It is an arithmetic number, because the mean of its divisors is an integer number (65277156391).
Almost surely, 2130554312781 is an apocalyptic number.
It is an amenable number.
130554312781 is a deficient number, since it is larger than the sum of its proper divisors (1).
130554312781 is an equidigital number, since it uses as much as digits as its factorization.
130554312781 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 100800, while the sum is 40.
The spelling of 130554312781 in words is "one hundred thirty billion, five hundred fifty-four million, three hundred twelve thousand, seven hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •