Base | Representation |
---|---|
bin | 111100101000111011… |
… | …0101100001010000001 |
3 | 110110010102020202122011 |
4 | 1321101312230022001 |
5 | 4113143402410032 |
6 | 135453500012521 |
7 | 12260013241342 |
oct | 1712166541201 |
9 | 413112222564 |
10 | 130222310017 |
11 | 5025510aa18 |
12 | 212a3231141 |
13 | c383c70817 |
14 | 6434c180c9 |
15 | 35c2628247 |
hex | 1e51dac281 |
130222310017 has 2 divisors, whose sum is σ = 130222310018. Its totient is φ = 130222310016.
The previous prime is 130222310003. The next prime is 130222310021. The reversal of 130222310017 is 710013222031.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 102987079056 + 27235230961 = 320916^2 + 165031^2 .
It is a cyclic number.
It is not a de Polignac number, because 130222310017 - 227 = 130088092289 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 130222310017.
It is not a weakly prime, because it can be changed into another prime (130222310027) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65111155008 + 65111155009.
It is an arithmetic number, because the mean of its divisors is an integer number (65111155009).
Almost surely, 2130222310017 is an apocalyptic number.
It is an amenable number.
130222310017 is a deficient number, since it is larger than the sum of its proper divisors (1).
130222310017 is an equidigital number, since it uses as much as digits as its factorization.
130222310017 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 504, while the sum is 22.
Adding to 130222310017 its reverse (710013222031), we get a palindrome (840235532048).
The spelling of 130222310017 in words is "one hundred thirty billion, two hundred twenty-two million, three hundred ten thousand, seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •