Base | Representation |
---|---|
bin | 111100101010001100… |
… | …0001001111111000101 |
3 | 110110020100220012212022 |
4 | 1321110120021333011 |
5 | 4113240221344011 |
6 | 135502011132525 |
7 | 12261036101624 |
oct | 1712430117705 |
9 | 413210805768 |
10 | 130264637381 |
11 | 50276aa010a |
12 | 212b5444145 |
13 | c38c9707b8 |
14 | 643a6b56bb |
15 | 35c61d98db |
hex | 1e54609fc5 |
130264637381 has 2 divisors, whose sum is σ = 130264637382. Its totient is φ = 130264637380.
The previous prime is 130264637329. The next prime is 130264637389. The reversal of 130264637381 is 183736462031.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 95239514881 + 35025122500 = 308609^2 + 187150^2 .
It is a cyclic number.
It is not a de Polignac number, because 130264637381 - 210 = 130264636357 is a prime.
It is a super-3 number, since 3×1302646373813 (a number of 34 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (130264637389) 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, 65132318690 + 65132318691.
It is an arithmetic number, because the mean of its divisors is an integer number (65132318691).
Almost surely, 2130264637381 is an apocalyptic number.
It is an amenable number.
130264637381 is a deficient number, since it is larger than the sum of its proper divisors (1).
130264637381 is an equidigital number, since it uses as much as digits as its factorization.
130264637381 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 435456, while the sum is 44.
The spelling of 130264637381 in words is "one hundred thirty billion, two hundred sixty-four million, six hundred thirty-seven thousand, three hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •