Base | Representation |
---|---|
bin | 111100101011110111… |
… | …1100101011111100101 |
3 | 110110101022011101010022 |
4 | 1321113233211133211 |
5 | 4113344201023023 |
6 | 135511345404525 |
7 | 12262323111032 |
oct | 1712757453745 |
9 | 413338141108 |
10 | 130321111013 |
11 | 502a5962635 |
12 | 21310339745 |
13 | c39b584652 |
14 | 6443db6389 |
15 | 35cb1427c8 |
hex | 1e57be57e5 |
130321111013 has 2 divisors, whose sum is σ = 130321111014. Its totient is φ = 130321111012.
The previous prime is 130321110937. The next prime is 130321111033. The reversal of 130321111013 is 310111123031.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 130319556004 + 1555009 = 360998^2 + 1247^2 .
It is a cyclic number.
It is not a de Polignac number, because 130321111013 - 218 = 130320848869 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 130321110982 and 130321111000.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (130321111033) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65160555506 + 65160555507.
It is an arithmetic number, because the mean of its divisors is an integer number (65160555507).
Almost surely, 2130321111013 is an apocalyptic number.
It is an amenable number.
130321111013 is a deficient number, since it is larger than the sum of its proper divisors (1).
130321111013 is an equidigital number, since it uses as much as digits as its factorization.
130321111013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 54, while the sum is 17.
Adding to 130321111013 its reverse (310111123031), we get a palindrome (440432234044).
The spelling of 130321111013 in words is "one hundred thirty billion, three hundred twenty-one million, one hundred eleven thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •