Base | Representation |
---|---|
bin | 11101100110101001111100… |
… | …110101001010111101100001 |
3 | 122001222222021020202010020001 |
4 | 131212221330311022331201 |
5 | 114031143023112034012 |
6 | 1140524533115420001 |
7 | 36265422520434133 |
oct | 3546517465127541 |
9 | 561888236663201 |
10 | 130199732924257 |
11 | 3853843aa32477 |
12 | 127296b7154601 |
13 | 5785a22463579 |
14 | 24219b49db053 |
15 | 100bbd9364357 |
hex | 766a7cd4af61 |
130199732924257 has 2 divisors, whose sum is σ = 130199732924258. Its totient is φ = 130199732924256.
The previous prime is 130199732924203. The next prime is 130199732924273. The reversal of 130199732924257 is 752429237991031.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 124535980265761 + 5663752658496 = 11159569^2 + 2379864^2 .
It is a cyclic number.
It is not a de Polignac number, because 130199732924257 - 215 = 130199732891489 is a prime.
It is not a weakly prime, because it can be changed into another prime (130199732924297) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65099866462128 + 65099866462129.
It is an arithmetic number, because the mean of its divisors is an integer number (65099866462129).
Almost surely, 2130199732924257 is an apocalyptic number.
It is an amenable number.
130199732924257 is a deficient number, since it is larger than the sum of its proper divisors (1).
130199732924257 is an equidigital number, since it uses as much as digits as its factorization.
130199732924257 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 51438240, while the sum is 64.
The spelling of 130199732924257 in words is "one hundred thirty trillion, one hundred ninety-nine billion, seven hundred thirty-two million, nine hundred twenty-four thousand, two hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •