Base | Representation |
---|---|
bin | 10011110010100… |
… | …01010011100001 |
3 | 102120101002012200 |
4 | 21321101103201 |
5 | 314444224113 |
6 | 24250043413 |
7 | 4054021302 |
oct | 1171212341 |
9 | 376332180 |
10 | 166008033 |
11 | 85786324 |
12 | 47719569 |
13 | 28515309 |
14 | 180947a9 |
15 | e892873 |
hex | 9e514e1 |
166008033 has 6 divisors (see below), whose sum is σ = 239789394. Its totient is φ = 110672016.
The previous prime is 166008013. The next prime is 166008049. The reversal of 166008033 is 330800661.
It can be written as a sum of positive squares in only one way, i.e., 141919569 + 24088464 = 11913^2 + 4908^2 .
It is not a de Polignac number, because 166008033 - 29 = 166007521 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 166007988 and 166008006.
It is not an unprimeable number, because it can be changed into a prime (166008013) 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 in 5 ways as a sum of consecutive naturals, for example, 9222660 + ... + 9222677.
It is an arithmetic number, because the mean of its divisors is an integer number (39964899).
Almost surely, 2166008033 is an apocalyptic number.
It is an amenable number.
166008033 is a deficient number, since it is larger than the sum of its proper divisors (73781361).
166008033 is a wasteful number, since it uses less digits than its factorization.
166008033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18445343 (or 18445340 counting only the distinct ones).
The product of its (nonzero) digits is 2592, while the sum is 27.
The square root of 166008033 is about 12884.4104638125. The cubic root of 166008033 is about 549.5953309831.
Adding to 166008033 its reverse (330800661), we get a palindrome (496808694).
The spelling of 166008033 in words is "one hundred sixty-six million, eight thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.183 sec. • engine limits •