Base | Representation |
---|---|
bin | 11101101110100010010010… |
… | …110001000101111110010001 |
3 | 122010220202001200100000120222 |
4 | 131232202102301011332101 |
5 | 114114031103302131142 |
6 | 1142021413034442425 |
7 | 36352513320631361 |
oct | 3556422261057621 |
9 | 563822050300528 |
10 | 130741266833297 |
11 | 3872707278952a |
12 | 127b6649893415 |
13 | 57c4b05399183 |
14 | 243dca7dda9a1 |
15 | 101ad31475bd2 |
hex | 76e892c45f91 |
130741266833297 has 2 divisors, whose sum is σ = 130741266833298. Its totient is φ = 130741266833296.
The previous prime is 130741266833279. The next prime is 130741266833347. The reversal of 130741266833297 is 792338662147031.
It is a happy number.
Together with previous prime (130741266833279) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 83008699249921 + 47732567583376 = 9110911^2 + 6908876^2 .
It is a cyclic number.
It is not a de Polignac number, because 130741266833297 - 28 = 130741266833041 is a prime.
It is not a weakly prime, because it can be changed into another prime (130741266833227) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65370633416648 + 65370633416649.
It is an arithmetic number, because the mean of its divisors is an integer number (65370633416649).
Almost surely, 2130741266833297 is an apocalyptic number.
It is an amenable number.
130741266833297 is a deficient number, since it is larger than the sum of its proper divisors (1).
130741266833297 is an equidigital number, since it uses as much as digits as its factorization.
130741266833297 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 54867456, while the sum is 62.
The spelling of 130741266833297 in words is "one hundred thirty trillion, seven hundred forty-one billion, two hundred sixty-six million, eight hundred thirty-three thousand, two hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •