Base | Representation |
---|---|
bin | 100101110000011011101101… |
… | …100101010000110110100001 |
3 | 210202221210120221212222201000 |
4 | 211300123231211100312201 |
5 | 133231130202430111442 |
6 | 1345101024550302213 |
7 | 46656102524225643 |
oct | 4560335545206641 |
9 | 722853527788630 |
10 | 166056011566497 |
11 | 48a01a60504658 |
12 | 1675a926357969 |
13 | 71870263ac580 |
14 | 2d01222208893 |
15 | 142e77081ed4c |
hex | 9706ed950da1 |
166056011566497 has 32 divisors (see below), whose sum is σ = 264935462722560. Its totient is φ = 102187236856320.
The previous prime is 166056011566453. The next prime is 166056011566513. The reversal of 166056011566497 is 794665110650661.
It is a happy number.
166056011566497 is a `hidden beast` number, since 1 + 6 + 6 + 0 + 5 + 60 + 1 + 1 + 566 + 4 + 9 + 7 = 666.
It is not a de Polignac number, because 166056011566497 - 211 = 166056011564449 is a prime.
It is not an unprimeable number, because it can be changed into a prime (166056011566447) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 31484593 + ... + 36378449.
It is an arithmetic number, because the mean of its divisors is an integer number (8279233210080).
Almost surely, 2166056011566497 is an apocalyptic number.
It is an amenable number.
166056011566497 is a deficient number, since it is larger than the sum of its proper divisors (98879451156063).
166056011566497 is a wasteful number, since it uses less digits than its factorization.
166056011566497 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4990550 (or 4990544 counting only the distinct ones).
The product of its (nonzero) digits is 48988800, while the sum is 63.
The spelling of 166056011566497 in words is "one hundred sixty-six trillion, fifty-six billion, eleven million, five hundred sixty-six thousand, four hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •