Base | Representation |
---|---|
bin | 1001101100110100010… |
… | …1100011101100000001 |
3 | 120221011002111221202001 |
4 | 2123031011203230001 |
5 | 10212244240342200 |
6 | 204320250024001 |
7 | 15016505514121 |
oct | 2331505435401 |
9 | 527132457661 |
10 | 166649543425 |
11 | 647483605a2 |
12 | 2836a718001 |
13 | 1293aa898c1 |
14 | 80ccac4c81 |
15 | 450562c76a |
hex | 26cd163b01 |
166649543425 has 12 divisors (see below), whose sum is σ = 208153798956. Its totient is φ = 132346496000.
The previous prime is 166649543407. The next prime is 166649543443. The reversal of 166649543425 is 524345946661.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (166649543407) and next prime (166649543443).
It can be written as a sum of positive squares in 6 ways, for example, as 16947873856 + 149701669569 = 130184^2 + 386913^2 .
It is not a de Polignac number, because 166649543425 - 213 = 166649535233 is a prime.
It is a Duffinian number.
It is an unprimeable number.
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 11 ways as a sum of consecutive naturals, for example, 24324976 + ... + 24331825.
It is an arithmetic number, because the mean of its divisors is an integer number (17346149913).
Almost surely, 2166649543425 is an apocalyptic number.
It is an amenable number.
166649543425 is a deficient number, since it is larger than the sum of its proper divisors (41504255531).
166649543425 is a wasteful number, since it uses less digits than its factorization.
166649543425 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 48656948 (or 48656943 counting only the distinct ones).
The product of its digits is 18662400, while the sum is 55.
The spelling of 166649543425 in words is "one hundred sixty-six billion, six hundred forty-nine million, five hundred forty-three thousand, four hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •