Base | Representation |
---|---|
bin | 110101100111111010… |
… | …0000000000001111001 |
3 | 102000020101200220012021 |
4 | 1223033310000001321 |
5 | 3341314322240032 |
6 | 124522441314441 |
7 | 11214444000541 |
oct | 1531764000171 |
9 | 360211626167 |
10 | 115155665017 |
11 | 44923409598 |
12 | 1a399495a21 |
13 | ab2268c073 |
14 | 5805c06321 |
15 | 2edea4c097 |
hex | 1acfd00079 |
115155665017 has 2 divisors, whose sum is σ = 115155665018. Its totient is φ = 115155665016.
The previous prime is 115155665011. The next prime is 115155665021. The reversal of 115155665017 is 710566551511.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 106190605161 + 8965059856 = 325869^2 + 94684^2 .
It is a cyclic number.
It is not a de Polignac number, because 115155665017 - 231 = 113008181369 is a prime.
It is a super-2 number, since 2×1151556650172 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (115155665011) 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, 57577832508 + 57577832509.
It is an arithmetic number, because the mean of its divisors is an integer number (57577832509).
Almost surely, 2115155665017 is an apocalyptic number.
It is an amenable number.
115155665017 is a deficient number, since it is larger than the sum of its proper divisors (1).
115155665017 is an equidigital number, since it uses as much as digits as its factorization.
115155665017 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 157500, while the sum is 43.
The spelling of 115155665017 in words is "one hundred fifteen billion, one hundred fifty-five million, six hundred sixty-five thousand, seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •