Base | Representation |
---|---|
bin | 1111001001010… |
… | …00110111000001 |
3 | 22212001120001111 |
4 | 13210220313001 |
5 | 230010420212 |
6 | 20335003321 |
7 | 3101602516 |
oct | 744506701 |
9 | 285046044 |
10 | 127045057 |
11 | 65793917 |
12 | 36669541 |
13 | 204227b9 |
14 | 12c3130d |
15 | b247ea7 |
hex | 7928dc1 |
127045057 has 4 divisors (see below), whose sum is σ = 128834496. Its totient is φ = 125255620.
The previous prime is 127045049. The next prime is 127045067. The reversal of 127045057 is 750540721.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 127045057 - 23 = 127045049 is a prime.
It is a super-2 number, since 2×1270450572 = 32280893016266498, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (127045007) 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 3 ways as a sum of consecutive naturals, for example, 894613 + ... + 894754.
It is an arithmetic number, because the mean of its divisors is an integer number (32208624).
Almost surely, 2127045057 is an apocalyptic number.
It is an amenable number.
127045057 is a deficient number, since it is larger than the sum of its proper divisors (1789439).
127045057 is an equidigital number, since it uses as much as digits as its factorization.
127045057 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1789438.
The product of its (nonzero) digits is 9800, while the sum is 31.
The square root of 127045057 is about 11271.4265734201. The cubic root of 127045057 is about 502.7120061167.
Adding to 127045057 its reverse (750540721), we get a palindrome (877585778).
The spelling of 127045057 in words is "one hundred twenty-seven million, forty-five thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •