Base | Representation |
---|---|
bin | 10100101111110… |
… | …10110000010101 |
3 | 110010111020220221 |
4 | 22113322300111 |
5 | 324023322013 |
6 | 25134154341 |
7 | 4212222316 |
oct | 1227726025 |
9 | 403436827 |
10 | 174042133 |
11 | 8a273481 |
12 | 4a3529b1 |
13 | 2a099115 |
14 | 1918660d |
15 | 1042d08d |
hex | a5fac15 |
174042133 has 4 divisors (see below), whose sum is σ = 174073228. Its totient is φ = 174011040.
The previous prime is 174042097. The next prime is 174042139. The reversal of 174042133 is 331240471.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 331240471 = 19 ⋅17433709.
It can be written as a sum of positive squares in 2 ways, for example, as 11785489 + 162256644 = 3433^2 + 12738^2 .
It is a cyclic number.
It is not a de Polignac number, because 174042133 - 213 = 174033941 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 174042098 and 174042107.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (174042139) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4566 + ... + 19207.
It is an arithmetic number, because the mean of its divisors is an integer number (43518307).
Almost surely, 2174042133 is an apocalyptic number.
It is an amenable number.
174042133 is a deficient number, since it is larger than the sum of its proper divisors (31095).
174042133 is an equidigital number, since it uses as much as digits as its factorization.
174042133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31094.
The product of its (nonzero) digits is 2016, while the sum is 25.
The square root of 174042133 is about 13192.5029088494. The cubic root of 174042133 is about 558.3220746127.
The spelling of 174042133 in words is "one hundred seventy-four million, forty-two thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •