Base | Representation |
---|---|
bin | 111100100100001101… |
… | …1010100101111101101 |
3 | 110102201101121221221021 |
4 | 1321020123110233231 |
5 | 4112332410010133 |
6 | 135430045534141 |
7 | 12253052650132 |
oct | 1711033245755 |
9 | 412641557837 |
10 | 130064141293 |
11 | 501838a9469 |
12 | 2125a274351 |
13 | c35a271768 |
14 | 641bc04589 |
15 | 35b37d352d |
hex | 1e486d4bed |
130064141293 has 2 divisors, whose sum is σ = 130064141294. Its totient is φ = 130064141292.
The previous prime is 130064141237. The next prime is 130064141329. The reversal of 130064141293 is 392141460031.
Together with next prime (130064141329) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 122546904489 + 7517236804 = 350067^2 + 86702^2 .
It is a cyclic number.
It is not a de Polignac number, because 130064141293 - 29 = 130064140781 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (130064147293) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65032070646 + 65032070647.
It is an arithmetic number, because the mean of its divisors is an integer number (65032070647).
Almost surely, 2130064141293 is an apocalyptic number.
It is an amenable number.
130064141293 is a deficient number, since it is larger than the sum of its proper divisors (1).
130064141293 is an equidigital number, since it uses as much as digits as its factorization.
130064141293 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 15552, while the sum is 34.
The spelling of 130064141293 in words is "one hundred thirty billion, sixty-four million, one hundred forty-one thousand, two hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •