Base | Representation |
---|---|
bin | 100101110011110001000000… |
… | …111000111010001110000001 |
3 | 210210202200202111222111200012 |
4 | 211303301000320322032001 |
5 | 133243403231334223124 |
6 | 1345354143254034305 |
7 | 50011461240043400 |
oct | 4563610070721601 |
9 | 723680674874605 |
10 | 166285042492289 |
11 | 48a900aa499006 |
12 | 167971a4348995 |
13 | 71a27c6093b36 |
14 | 2d0c34bb57637 |
15 | 14356c7799e0e |
hex | 973c40e3a381 |
166285042492289 has 6 divisors (see below), whose sum is σ = 193433620858434. Its totient is φ = 142530036421920.
The previous prime is 166285042492279. The next prime is 166285042492291. The reversal of 166285042492289 is 982294240582661.
It can be written as a sum of positive squares in only one way, i.e., 118089624279025 + 48195418213264 = 10866905^2 + 6942292^2 .
It is not a de Polignac number, because 166285042492289 - 28 = 166285042492033 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (166285042492249) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 1696786147832 + ... + 1696786147929.
It is an arithmetic number, because the mean of its divisors is an integer number (32238936809739).
Almost surely, 2166285042492289 is an apocalyptic number.
It is an amenable number.
166285042492289 is a deficient number, since it is larger than the sum of its proper divisors (27148578366145).
166285042492289 is an equidigital number, since it uses as much as digits as its factorization.
166285042492289 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3393572295775 (or 3393572295768 counting only the distinct ones).
The product of its (nonzero) digits is 238878720, while the sum is 68.
The spelling of 166285042492289 in words is "one hundred sixty-six trillion, two hundred eighty-five billion, forty-two million, four hundred ninety-two thousand, two hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •