Base | Representation |
---|---|
bin | 1111111010010… |
… | …00100000110001 |
3 | 100022010210011011 |
4 | 13331020200301 |
5 | 233131404121 |
6 | 21124350521 |
7 | 3210305113 |
oct | 775104061 |
9 | 308123134 |
10 | 133466161 |
11 | 6937a114 |
12 | 38845441 |
13 | 2186037a |
14 | 13a233b3 |
15 | bab57e1 |
hex | 7f48831 |
133466161 has 2 divisors, whose sum is σ = 133466162. Its totient is φ = 133466160.
The previous prime is 133466143. The next prime is 133466183. The reversal of 133466161 is 161664331.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 120033936 + 13432225 = 10956^2 + 3665^2 .
It is a cyclic number.
It is not a de Polignac number, because 133466161 - 213 = 133457969 is a prime.
It is a super-2 number, since 2×1334661612 = 35626432264155842, which contains 22 as substring.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (133416161) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66733080 + 66733081.
It is an arithmetic number, because the mean of its divisors is an integer number (66733081).
Almost surely, 2133466161 is an apocalyptic number.
It is an amenable number.
133466161 is a deficient number, since it is larger than the sum of its proper divisors (1).
133466161 is an equidigital number, since it uses as much as digits as its factorization.
133466161 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 7776, while the sum is 31.
The square root of 133466161 is about 11552.7555587401. The cubic root of 133466161 is about 511.0425437827.
The spelling of 133466161 in words is "one hundred thirty-three million, four hundred sixty-six thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •