Base | Representation |
---|---|
bin | 1111111110011… |
… | …01110100010001 |
3 | 100100011112010222 |
4 | 13333031310101 |
5 | 233301342202 |
6 | 21144202425 |
7 | 3215041025 |
oct | 777156421 |
9 | 310145128 |
10 | 134012177 |
11 | 69712372 |
12 | 38a69415 |
13 | 219c1a60 |
14 | 13b26385 |
15 | bb724a2 |
hex | 7fcdd11 |
134012177 has 4 divisors (see below), whose sum is σ = 144320820. Its totient is φ = 123703536.
The previous prime is 134012171. The next prime is 134012227. The reversal of 134012177 is 771210431.
It is a happy number.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 771210431 = 97 ⋅7950623.
It can be written as a sum of positive squares in 2 ways, for example, as 8549776 + 125462401 = 2924^2 + 11201^2 .
It is a cyclic number.
It is not a de Polignac number, because 134012177 - 214 = 133995793 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (134012171) 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, 5154302 + ... + 5154327.
It is an arithmetic number, because the mean of its divisors is an integer number (36080205).
Almost surely, 2134012177 is an apocalyptic number.
It is an amenable number.
134012177 is a deficient number, since it is larger than the sum of its proper divisors (10308643).
134012177 is a wasteful number, since it uses less digits than its factorization.
134012177 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10308642.
The product of its (nonzero) digits is 1176, while the sum is 26.
The square root of 134012177 is about 11576.3628571326. The cubic root of 134012177 is about 511.7384948458.
The spelling of 134012177 in words is "one hundred thirty-four million, twelve thousand, one hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •