Base | Representation |
---|---|
bin | 1111001110110… |
… | …01110111110101 |
3 | 22220102101121222 |
4 | 13213121313311 |
5 | 230202120401 |
6 | 20402320125 |
7 | 3111012404 |
oct | 747316765 |
9 | 286371558 |
10 | 127770101 |
11 | 66139628 |
12 | 36959045 |
13 | 20617814 |
14 | 12d7d63b |
15 | b33cc1b |
hex | 79d9df5 |
127770101 has 2 divisors, whose sum is σ = 127770102. Its totient is φ = 127770100.
The previous prime is 127770089. The next prime is 127770103. The reversal of 127770101 is 101077721.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 87142225 + 40627876 = 9335^2 + 6374^2 .
It is an emirp because it is prime and its reverse (101077721) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-127770101 is a prime.
Together with 127770103, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (127770103) 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, 63885050 + 63885051.
It is an arithmetic number, because the mean of its divisors is an integer number (63885051).
Almost surely, 2127770101 is an apocalyptic number.
It is an amenable number.
127770101 is a deficient number, since it is larger than the sum of its proper divisors (1).
127770101 is an equidigital number, since it uses as much as digits as its factorization.
127770101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 686, while the sum is 26.
The square root of 127770101 is about 11303.5437363687. The cubic root of 127770101 is about 503.6665156063. Note that the first 3 decimals are identical.
The spelling of 127770101 in words is "one hundred twenty-seven million, seven hundred seventy thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •