Base | Representation |
---|---|
bin | 111011010001110000… |
… | …1011110010011100001 |
3 | 110011120120201122221121 |
4 | 1312203201132103201 |
5 | 4041201130401143 |
6 | 134251335252241 |
7 | 12124360001362 |
oct | 1664341362341 |
9 | 404516648847 |
10 | 127297512673 |
11 | 49a94144431 |
12 | 2080781a081 |
13 | c009029bc6 |
14 | 62385c9b69 |
15 | 34a098b7ed |
hex | 1da385e4e1 |
127297512673 has 2 divisors, whose sum is σ = 127297512674. Its totient is φ = 127297512672.
The previous prime is 127297512647. The next prime is 127297512679. The reversal of 127297512673 is 376215792721.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 85277432529 + 42020080144 = 292023^2 + 204988^2 .
It is an emirp because it is prime and its reverse (376215792721) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-127297512673 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 127297512673.
It is not a weakly prime, because it can be changed into another prime (127297512679) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 63648756336 + 63648756337.
It is an arithmetic number, because the mean of its divisors is an integer number (63648756337).
Almost surely, 2127297512673 is an apocalyptic number.
It is an amenable number.
127297512673 is a deficient number, since it is larger than the sum of its proper divisors (1).
127297512673 is an equidigital number, since it uses as much as digits as its factorization.
127297512673 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 2222640, while the sum is 52.
The spelling of 127297512673 in words is "one hundred twenty-seven billion, two hundred ninety-seven million, five hundred twelve thousand, six hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •