Base | Representation |
---|---|
bin | 1001101100001000100… |
… | …0000010000010010001 |
3 | 120220200021110211021220 |
4 | 2123002020002002101 |
5 | 10211410201031031 |
6 | 204250120235253 |
7 | 15012113421204 |
oct | 2330210020221 |
9 | 526607424256 |
10 | 166465642641 |
11 | 64663574181 |
12 | 2831900bb29 |
13 | 1290b94b37c |
14 | 80b24d393b |
15 | 44e4403596 |
hex | 26c2202091 |
166465642641 has 8 divisors (see below), whose sum is σ = 221963786304. Its totient is φ = 110972297040.
The previous prime is 166465642639. The next prime is 166465642643. The reversal of 166465642641 is 146246564661.
It is an interprime number because it is at equal distance from previous prime (166465642639) and next prime (166465642643).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 166465642641 - 21 = 166465642639 is a prime.
It is a super-2 number, since 2×1664656426412 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (166465642643) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1117765 + ... + 1257906.
It is an arithmetic number, because the mean of its divisors is an integer number (27745473288).
Almost surely, 2166465642641 is an apocalyptic number.
It is an amenable number.
166465642641 is a deficient number, since it is larger than the sum of its proper divisors (55498143663).
166465642641 is a wasteful number, since it uses less digits than its factorization.
166465642641 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2399031.
The product of its digits is 4976640, while the sum is 51.
The spelling of 166465642641 in words is "one hundred sixty-six billion, four hundred sixty-five million, six hundred forty-two thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •