Base | Representation |
---|---|
bin | 10011110100001… |
… | …01010000100001 |
3 | 102120202220010011 |
4 | 21322011100201 |
5 | 320023031313 |
6 | 24254404521 |
7 | 4055565562 |
oct | 1172052041 |
9 | 376686104 |
10 | 166220833 |
11 | 85911199 |
12 | 47800741 |
13 | 2858b12c |
14 | 1810c169 |
15 | e8d593d |
hex | 9e85421 |
166220833 has 4 divisors (see below), whose sum is σ = 166910788. Its totient is φ = 165530880.
The previous prime is 166220809. The next prime is 166220881. The reversal of 166220833 is 338022661.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 61199329 + 105021504 = 7823^2 + 10248^2 .
It is a cyclic number.
It is not a de Polignac number, because 166220833 - 25 = 166220801 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 166220795 and 166220804.
It is not an unprimeable number, because it can be changed into a prime (166220893) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 344616 + ... + 345097.
It is an arithmetic number, because the mean of its divisors is an integer number (41727697).
Almost surely, 2166220833 is an apocalyptic number.
It is an amenable number.
166220833 is a deficient number, since it is larger than the sum of its proper divisors (689955).
166220833 is an equidigital number, since it uses as much as digits as its factorization.
166220833 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 689954.
The product of its (nonzero) digits is 10368, while the sum is 31.
The square root of 166220833 is about 12892.6658608683. The cubic root of 166220833 is about 549.8300665093.
The spelling of 166220833 in words is "one hundred sixty-six million, two hundred twenty thousand, eight hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •