Base | Representation |
---|---|
bin | 1001101011011001000… |
… | …0101100010111000100 |
3 | 120220011101220201200121 |
4 | 2122312100230113010 |
5 | 10211003221232224 |
6 | 204214245551324 |
7 | 15004145444611 |
oct | 2326620542704 |
9 | 526141821617 |
10 | 166266586564 |
11 | 64571176421 |
12 | 28282415544 |
13 | 128a9634900 |
14 | 8093cb9508 |
15 | 44d1bd3be4 |
hex | 26b642c5c4 |
166266586564 has 27 divisors (see below), whose sum is σ = 315090353613. Its totient is φ = 76733531472.
The previous prime is 166266586561. The next prime is 166266586579. The reversal of 166266586564 is 465685662661.
The square root of 166266586564 is 407758.
It is a perfect power (a square), and thus also a powerful number.
166266586564 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in only one way, i.e., 24595648900 + 141670937664 = 156830^2 + 376392^2 .
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (166266586561) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 10593867 + ... + 10609549.
Almost surely, 2166266586564 is an apocalyptic number.
166266586564 is the 407758-th square number.
It is an amenable number.
166266586564 is a deficient number, since it is larger than the sum of its proper divisors (148823767049).
166266586564 is an frugal number, since it uses more digits than its factorization.
166266586564 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31396 (or 15698 counting only the distinct ones).
The product of its digits is 74649600, while the sum is 61.
The spelling of 166266586564 in words is "one hundred sixty-six billion, two hundred sixty-six million, five hundred eighty-six thousand, five hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.289 sec. • engine limits •