Base | Representation |
---|---|
bin | 1111001010111… |
… | …00001000001101 |
3 | 22212110020010010 |
4 | 13211130020031 |
5 | 230034130203 |
6 | 20343303433 |
7 | 3103435662 |
oct | 745341015 |
9 | 285406103 |
10 | 127255053 |
11 | 65917672 |
12 | 3674ab79 |
13 | 20497263 |
14 | 12c87a69 |
15 | b28a303 |
hex | 795c20d |
127255053 has 8 divisors (see below), whose sum is σ = 170912448. Its totient is φ = 84217184.
The previous prime is 127255049. The next prime is 127255057. The reversal of 127255053 is 350552721.
It is an interprime number because it is at equal distance from previous prime (127255049) and next prime (127255057).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 127255053 - 22 = 127255049 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 127255053.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (127255057) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 154401 + ... + 155222.
It is an arithmetic number, because the mean of its divisors is an integer number (21364056).
Almost surely, 2127255053 is an apocalyptic number.
It is an amenable number.
127255053 is a deficient number, since it is larger than the sum of its proper divisors (43657395).
127255053 is a wasteful number, since it uses less digits than its factorization.
127255053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 309763.
The product of its (nonzero) digits is 10500, while the sum is 30.
The square root of 127255053 is about 11280.7381407424. The cubic root of 127255053 is about 502.9888354590.
The spelling of 127255053 in words is "one hundred twenty-seven million, two hundred fifty-five thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •