Base | Representation |
---|---|
bin | 1111001110110… |
… | …01111000100111 |
3 | 22220102101200211 |
4 | 13213121320213 |
5 | 230202121101 |
6 | 20402320251 |
7 | 3111012505 |
oct | 747317047 |
9 | 286371624 |
10 | 127770151 |
11 | 66139673 |
12 | 36959087 |
13 | 20617852 |
14 | 12d7d675 |
15 | b33cc51 |
hex | 79d9e27 |
127770151 has 4 divisors (see below), whose sum is σ = 129035304. Its totient is φ = 126505000.
The previous prime is 127770133. The next prime is 127770163. The reversal of 127770151 is 151077721.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 151077721 = 19 ⋅7951459.
It is a cyclic number.
It is not a de Polignac number, because 127770151 - 215 = 127737383 is a prime.
It is a super-2 number, since 2×1277701512 = 32650422973125602, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (127770101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 632425 + ... + 632626.
It is an arithmetic number, because the mean of its divisors is an integer number (32258826).
Almost surely, 2127770151 is an apocalyptic number.
127770151 is a deficient number, since it is larger than the sum of its proper divisors (1265153).
127770151 is a wasteful number, since it uses less digits than its factorization.
127770151 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1265152.
The product of its (nonzero) digits is 3430, while the sum is 31.
The square root of 127770151 is about 11303.5459480643. The cubic root of 127770151 is about 503.6665813059. Note that the first 3 decimals are identical.
The spelling of 127770151 in words is "one hundred twenty-seven million, seven hundred seventy thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •