Base | Representation |
---|---|
bin | 110110000101100010… |
… | …0000010110110000101 |
3 | 102002210200012110022211 |
4 | 1230023010002312011 |
5 | 3400333312222342 |
6 | 125205231423421 |
7 | 11251204246342 |
oct | 1541304026605 |
9 | 362720173284 |
10 | 116149726597 |
11 | 45293546793 |
12 | 1a616384b71 |
13 | ac505ca298 |
14 | 589bc497c9 |
15 | 304be58c17 |
hex | 1b0b102d85 |
116149726597 has 2 divisors, whose sum is σ = 116149726598. Its totient is φ = 116149726596.
The previous prime is 116149726579. The next prime is 116149726661. The reversal of 116149726597 is 795627941611.
Together with previous prime (116149726579) 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., 115930716196 + 219010401 = 340486^2 + 14799^2 .
It is a cyclic number.
It is not a de Polignac number, because 116149726597 - 235 = 81789988229 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (116149726577) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 58074863298 + 58074863299.
It is an arithmetic number, because the mean of its divisors is an integer number (58074863299).
Almost surely, 2116149726597 is an apocalyptic number.
It is an amenable number.
116149726597 is a deficient number, since it is larger than the sum of its proper divisors (1).
116149726597 is an equidigital number, since it uses as much as digits as its factorization.
116149726597 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 5715360, while the sum is 58.
The spelling of 116149726597 in words is "one hundred sixteen billion, one hundred forty-nine million, seven hundred twenty-six thousand, five hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •