Base | Representation |
---|---|
bin | 10011110101100… |
… | …00000010110011 |
3 | 102121002210111220 |
4 | 21322300002303 |
5 | 320044133313 |
6 | 24302240123 |
7 | 4060225530 |
oct | 1172600263 |
9 | 377083456 |
10 | 166396083 |
11 | 85a20927 |
12 | 47886043 |
13 | 2861cb29 |
14 | 18155d87 |
15 | e91c823 |
hex | 9eb00b3 |
166396083 has 8 divisors (see below), whose sum is σ = 253555968. Its totient is φ = 95083464.
The previous prime is 166396079. The next prime is 166396093. The reversal of 166396083 is 380693661.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 166396083 - 22 = 166396079 is a prime.
It is a Smith number, since the sum of its digits (42) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is not an unprimeable number, because it can be changed into a prime (166396063) 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 7 ways as a sum of consecutive naturals, for example, 3961791 + ... + 3961832.
It is an arithmetic number, because the mean of its divisors is an integer number (31694496).
Almost surely, 2166396083 is an apocalyptic number.
166396083 is a deficient number, since it is larger than the sum of its proper divisors (87159885).
166396083 is an equidigital number, since it uses as much as digits as its factorization.
166396083 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7923633.
The product of its (nonzero) digits is 139968, while the sum is 42.
The square root of 166396083 is about 12899.4605701169. The cubic root of 166396083 is about 550.0232309747.
It can be divided in two parts, 16639 and 6083, that added together give a palindrome (22722).
The spelling of 166396083 in words is "one hundred sixty-six million, three hundred ninety-six thousand, eighty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •