Base | Representation |
---|---|
bin | 10011110011000… |
… | …11001000001101 |
3 | 102120111210100112 |
4 | 21321203020031 |
5 | 320004043122 |
6 | 24251405405 |
7 | 4054444163 |
oct | 1171431015 |
9 | 376453315 |
10 | 166081037 |
11 | 85826161 |
12 | 47753865 |
13 | 2853c605 |
14 | 180b3233 |
15 | e8a92e2 |
hex | 9e6320d |
166081037 has 8 divisors (see below), whose sum is σ = 171222072. Its totient is φ = 160992000.
The previous prime is 166081021. The next prime is 166081039. The reversal of 166081037 is 730180661.
It can be written as a sum of positive squares in 4 ways, for example, as 32041 + 166048996 = 179^2 + 12886^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 166081037 - 24 = 166081021 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 166080994 and 166081012.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (166081039) 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, 6464 + ... + 19337.
It is an arithmetic number, because the mean of its divisors is an integer number (21402759).
Almost surely, 2166081037 is an apocalyptic number.
It is an amenable number.
166081037 is a deficient number, since it is larger than the sum of its proper divisors (5141035).
166081037 is a wasteful number, since it uses less digits than its factorization.
166081037 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25999.
The product of its (nonzero) digits is 6048, while the sum is 32.
The square root of 166081037 is about 12887.2431885179. The cubic root of 166081037 is about 549.6758828632.
The spelling of 166081037 in words is "one hundred sixty-six million, eighty-one thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •