Base | Representation |
---|---|
bin | 111011001001001001… |
… | …1101010000100110001 |
3 | 110010211110020100112021 |
4 | 1312102103222010301 |
5 | 4040103210200233 |
6 | 134202540431441 |
7 | 12114251644345 |
oct | 1662223520461 |
9 | 403743210467 |
10 | 127008678193 |
11 | 499560a6851 |
12 | 20746b48581 |
13 | bc9123b327 |
14 | 620c0c1625 |
15 | 3485435e2d |
hex | 1d924ea131 |
127008678193 has 2 divisors, whose sum is σ = 127008678194. Its totient is φ = 127008678192.
The previous prime is 127008678151. The next prime is 127008678227. The reversal of 127008678193 is 391876800721.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 124089221169 + 2919457024 = 352263^2 + 54032^2 .
It is a cyclic number.
It is not a de Polignac number, because 127008678193 - 217 = 127008547121 is a prime.
It is a super-2 number, since 2×1270086781932 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 127008678193.
It is not a weakly prime, because it can be changed into another prime (127008678493) 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, 63504339096 + 63504339097.
It is an arithmetic number, because the mean of its divisors is an integer number (63504339097).
Almost surely, 2127008678193 is an apocalyptic number.
It is an amenable number.
127008678193 is a deficient number, since it is larger than the sum of its proper divisors (1).
127008678193 is an equidigital number, since it uses as much as digits as its factorization.
127008678193 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1016064, while the sum is 52.
The spelling of 127008678193 in words is "one hundred twenty-seven billion, eight million, six hundred seventy-eight thousand, one hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •