Base | Representation |
---|---|
bin | 11100111011000101000110… |
… | …100110001001101010010101 |
3 | 121200101200221020201110122101 |
4 | 130323011012212021222111 |
5 | 113133112303041434142 |
6 | 1130313135403002101 |
7 | 35536163126442505 |
oct | 3473050646115225 |
9 | 550350836643571 |
10 | 127205230811797 |
11 | 37593487618006 |
12 | 12325286509331 |
13 | 55c952b987978 |
14 | 235aaa1d6ba05 |
15 | ea8d776240b7 |
hex | 73b146989a95 |
127205230811797 has 2 divisors, whose sum is σ = 127205230811798. Its totient is φ = 127205230811796.
The previous prime is 127205230811731. The next prime is 127205230811821. The reversal of 127205230811797 is 797118032502721.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 97553568440241 + 29651662371556 = 9876921^2 + 5445334^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-127205230811797 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (127205230811717) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 63602615405898 + 63602615405899.
It is an arithmetic number, because the mean of its divisors is an integer number (63602615405899).
Almost surely, 2127205230811797 is an apocalyptic number.
It is an amenable number.
127205230811797 is a deficient number, since it is larger than the sum of its proper divisors (1).
127205230811797 is an equidigital number, since it uses as much as digits as its factorization.
127205230811797 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2963520, while the sum is 55.
The spelling of 127205230811797 in words is "one hundred twenty-seven trillion, two hundred five billion, two hundred thirty million, eight hundred eleven thousand, seven hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •