Base | Representation |
---|---|
bin | 10011110111100… |
… | …11100111111001 |
3 | 102121121212012222 |
4 | 21323303213321 |
5 | 320132013024 |
6 | 24312213425 |
7 | 4062460535 |
oct | 1173634771 |
9 | 377555188 |
10 | 166672889 |
11 | 8609a899 |
12 | 4799a275 |
13 | 286b8b16 |
14 | 181c8bc5 |
15 | e97485e |
hex | 9ef39f9 |
166672889 has 4 divisors (see below), whose sum is σ = 172420260. Its totient is φ = 160925520.
The previous prime is 166672873. The next prime is 166672897. The reversal of 166672889 is 988276661.
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 96196864 + 70476025 = 9808^2 + 8395^2 .
It is a cyclic number.
It is not a de Polignac number, because 166672889 - 24 = 166672873 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 166672889.
It is not an unprimeable number, because it can be changed into a prime (166672829) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2873642 + ... + 2873699.
It is an arithmetic number, because the mean of its divisors is an integer number (43105065).
Almost surely, 2166672889 is an apocalyptic number.
It is an amenable number.
166672889 is a deficient number, since it is larger than the sum of its proper divisors (5747371).
166672889 is an equidigital number, since it uses as much as digits as its factorization.
166672889 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5747370.
The product of its digits is 1741824, while the sum is 53.
The square root of 166672889 is about 12910.1854750426. The cubic root of 166672889 is about 550.3280566279.
The spelling of 166672889 in words is "one hundred sixty-six million, six hundred seventy-two thousand, eight hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •