Base | Representation |
---|---|
bin | 100101101100… |
… | …1110100010110 |
3 | 1101012020121110 |
4 | 1023121310112 |
5 | 20030012200 |
6 | 1543355450 |
7 | 330004266 |
oct | 113316426 |
9 | 41166543 |
10 | 19766550 |
11 | 101809a1 |
12 | 6752b86 |
13 | 41310ab |
14 | 28a77a6 |
15 | 1b06b50 |
hex | 12d9d16 |
19766550 has 24 divisors (see below), whose sum is σ = 49021416. Its totient is φ = 5271040.
The previous prime is 19766543. The next prime is 19766557. The reversal of 19766550 is 5566791.
It is an interprime number because it is at equal distance from previous prime (19766543) and next prime (19766557).
It is a junction number, because it is equal to n+sod(n) for n = 19766499 and 19766508.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (19766557) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 65739 + ... + 66038.
It is an arithmetic number, because the mean of its divisors is an integer number (2042559).
Almost surely, 219766550 is an apocalyptic number.
19766550 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
19766550 is an abundant number, since it is smaller than the sum of its proper divisors (29254866).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
19766550 is a wasteful number, since it uses less digits than its factorization.
19766550 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 131792 (or 131787 counting only the distinct ones).
The product of its (nonzero) digits is 56700, while the sum is 39.
The square root of 19766550 is about 4445.9588392157. The cubic root of 19766550 is about 270.3814909048.
The spelling of 19766550 in words is "nineteen million, seven hundred sixty-six thousand, five hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •