Base | Representation |
---|---|
bin | 1111001001010… |
… | …11101011110111 |
3 | 22212002010221011 |
4 | 13210223223313 |
5 | 230011303011 |
6 | 20335133051 |
7 | 3101651332 |
oct | 744535367 |
9 | 285063834 |
10 | 127056631 |
11 | 657a1589 |
12 | 36674187 |
13 | 20427b50 |
14 | 12c35619 |
15 | b24b621 |
hex | 792baf7 |
127056631 has 16 divisors (see below), whose sum is σ = 145078528. Its totient is φ = 110419200.
The previous prime is 127056619. The next prime is 127056637. The reversal of 127056631 is 136650721.
It is a 8-Lehmer number, since φ(127056631) divides (127056631-1)8.
It is a cyclic number.
It is not a de Polignac number, because 127056631 - 25 = 127056599 is a prime.
It is a super-2 number, since 2×1270566312 = 32286774962140322, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (31).
It is a deceptive number, since it divides R127056630.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 127056593 and 127056602.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (127056637) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 10651 + ... + 19171.
It is an arithmetic number, because the mean of its divisors is an integer number (9067408).
Almost surely, 2127056631 is an apocalyptic number.
127056631 is a deficient number, since it is larger than the sum of its proper divisors (18021897).
127056631 is a wasteful number, since it uses less digits than its factorization.
127056631 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8602.
The product of its (nonzero) digits is 7560, while the sum is 31.
The square root of 127056631 is about 11271.9399838715. The cubic root of 127056631 is about 502.7272715986.
The spelling of 127056631 in words is "one hundred twenty-seven million, fifty-six thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •