Base | Representation |
---|---|
bin | 10011110011000… |
… | …00111110110001 |
3 | 102120111100021202 |
4 | 21321200332301 |
5 | 320003302431 |
6 | 24251300545 |
7 | 4054406426 |
oct | 1171407661 |
9 | 376440252 |
10 | 166072241 |
11 | 8581a595 |
12 | 4774a755 |
13 | 285385ca |
14 | 180add4d |
15 | e8a68cb |
hex | 9e60fb1 |
166072241 has 4 divisors (see below), whose sum is σ = 171798900. Its totient is φ = 160345584.
The previous prime is 166072223. The next prime is 166072253. The reversal of 166072241 is 142270661.
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 78836641 + 87235600 = 8879^2 + 9340^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-166072241 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (29), and also a Moran number because the ratio is a prime number: 5726629 = 166072241 / (1 + 6 + 6 + 0 + 7 + 2 + 2 + 4 + 1).
It is not an unprimeable number, because it can be changed into a prime (166072211) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2863286 + ... + 2863343.
It is an arithmetic number, because the mean of its divisors is an integer number (42949725).
Almost surely, 2166072241 is an apocalyptic number.
It is an amenable number.
166072241 is a deficient number, since it is larger than the sum of its proper divisors (5726659).
166072241 is an equidigital number, since it uses as much as digits as its factorization.
166072241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5726658.
The product of its (nonzero) digits is 4032, while the sum is 29.
The square root of 166072241 is about 12886.9019162869. The cubic root of 166072241 is about 549.6661786961. Note that the first 3 decimals are identical.
The spelling of 166072241 in words is "one hundred sixty-six million, seventy-two thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •