Base | Representation |
---|---|
bin | 1111110111000… |
… | …10101101010101 |
3 | 100021100121011011 |
4 | 13323202231111 |
5 | 233030033143 |
6 | 21111412221 |
7 | 3203620315 |
oct | 773425525 |
9 | 307317134 |
10 | 133049173 |
11 | 691148a4 |
12 | 38684071 |
13 | 2174562a |
14 | 13955445 |
15 | ba31e9d |
hex | 7ee2b55 |
133049173 has 2 divisors, whose sum is σ = 133049174. Its totient is φ = 133049172.
The previous prime is 133049171. The next prime is 133049183. The reversal of 133049173 is 371940331.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 114447204 + 18601969 = 10698^2 + 4313^2 .
It is a cyclic number.
It is not a de Polignac number, because 133049173 - 21 = 133049171 is a prime.
Together with 133049171, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (133049171) 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 as a sum of consecutive naturals, namely, 66524586 + 66524587.
It is an arithmetic number, because the mean of its divisors is an integer number (66524587).
Almost surely, 2133049173 is an apocalyptic number.
It is an amenable number.
133049173 is a deficient number, since it is larger than the sum of its proper divisors (1).
133049173 is an equidigital number, since it uses as much as digits as its factorization.
133049173 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6804, while the sum is 31.
The square root of 133049173 is about 11534.6943175795. The cubic root of 133049173 is about 510.5097722285.
The spelling of 133049173 in words is "one hundred thirty-three million, forty-nine thousand, one hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •