Base | Representation |
---|---|
bin | 10000000000011… |
… | …00000100100101 |
3 | 100100122110221021 |
4 | 20000030010211 |
5 | 233333022143 |
6 | 21153451141 |
7 | 3220152325 |
oct | 1000140445 |
9 | 310573837 |
10 | 134267173 |
11 | 69876a07 |
12 | 38b70ab1 |
13 | 21a80b41 |
14 | 13b91285 |
15 | bbc2ced |
hex | 800c125 |
134267173 has 4 divisors (see below), whose sum is σ = 142165260. Its totient is φ = 126369088.
The previous prime is 134267149. The next prime is 134267183. The reversal of 134267173 is 371762431.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 371762431 = 67 ⋅5548693.
It can be written as a sum of positive squares in 2 ways, for example, as 43007364 + 91259809 = 6558^2 + 9553^2 .
It is a cyclic number.
It is not a de Polignac number, because 134267173 - 25 = 134267141 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (134267143) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3949018 + ... + 3949051.
It is an arithmetic number, because the mean of its divisors is an integer number (35541315).
Almost surely, 2134267173 is an apocalyptic number.
It is an amenable number.
134267173 is a deficient number, since it is larger than the sum of its proper divisors (7898087).
134267173 is an equidigital number, since it uses as much as digits as its factorization.
134267173 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7898086.
The product of its digits is 21168, while the sum is 34.
The square root of 134267173 is about 11587.3712722084. The cubic root of 134267173 is about 512.0628648497.
The spelling of 134267173 in words is "one hundred thirty-four million, two hundred sixty-seven thousand, one hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •