Base | Representation |
---|---|
bin | 100101110000100100100011… |
… | …100000000011100011001110 |
3 | 210202222201002122112112202120 |
4 | 211300210203200003203032 |
5 | 133231304124030334200 |
6 | 1345105235035233410 |
7 | 46656560023410552 |
oct | 4560444340034316 |
9 | 722881078475676 |
10 | 166065506105550 |
11 | 48a05a92972347 |
12 | 16760735ba8866 |
13 | 7187baa45210c |
14 | 2d01883193862 |
15 | 142eb291369a0 |
hex | 9709238038ce |
166065506105550 has 48 divisors (see below), whose sum is σ = 413248060900080. Its totient is φ = 44132994557440.
The previous prime is 166065506105537. The next prime is 166065506105561. The reversal of 166065506105550 is 55501605560661.
It is a junction number, because it is equal to n+sod(n) for n = 166065506105493 and 166065506105502.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1889210955 + ... + 1889298854.
It is an arithmetic number, because the mean of its divisors is an integer number (8609334602085).
Almost surely, 2166065506105550 is an apocalyptic number.
166065506105550 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
166065506105550 is an abundant number, since it is smaller than the sum of its proper divisors (247182554794530).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
166065506105550 is a wasteful number, since it uses less digits than its factorization.
166065506105550 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3778510117 (or 3778510112 counting only the distinct ones).
The product of its (nonzero) digits is 4050000, while the sum is 51.
The spelling of 166065506105550 in words is "one hundred sixty-six trillion, sixty-five billion, five hundred six million, one hundred five thousand, five hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •