Base | Representation |
---|---|
bin | 100101110001010011001101… |
… | …010111100110100010100110 |
3 | 210210011111101211021101222022 |
4 | 211301103031113212202212 |
5 | 133233114222232002200 |
6 | 1345144241535303142 |
7 | 46663312304152316 |
oct | 4561231527464246 |
9 | 723144354241868 |
10 | 166115600656550 |
11 | 48a25259a44a16 |
12 | 1676a39667aab2 |
13 | 718c83197837c |
14 | 2d04076297446 |
15 | 14310abe56885 |
hex | 9714cd5e68a6 |
166115600656550 has 24 divisors (see below), whose sum is σ = 322408713624336. Its totient is φ = 63557273294240.
The previous prime is 166115600656547. The next prime is 166115600656633. The reversal of 166115600656550 is 55656006511661.
166115600656550 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 166115600656492 and 166115600656501.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 72224173049 + ... + 72224175348.
It is an arithmetic number, because the mean of its divisors is an integer number (13433696401014).
Almost surely, 2166115600656550 is an apocalyptic number.
166115600656550 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
166115600656550 is a deficient number, since it is larger than the sum of its proper divisors (156293112967786).
166115600656550 is a wasteful number, since it uses less digits than its factorization.
166115600656550 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 144448348432 (or 144448348427 counting only the distinct ones).
The product of its (nonzero) digits is 4860000, while the sum is 53.
The spelling of 166115600656550 in words is "one hundred sixty-six trillion, one hundred fifteen billion, six hundred million, six hundred fifty-six thousand, five hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •