Base | Representation |
---|---|
bin | 101110100010011… |
… | …0101110101010110 |
3 | 11000211022222010100 |
4 | 1131010311311112 |
5 | 11144224101131 |
6 | 414541234530 |
7 | 53460646251 |
oct | 13504656526 |
9 | 4024288110 |
10 | 1561550166 |
11 | 7314aa830 |
12 | 376b62a46 |
13 | 1bb6929a7 |
14 | 10b566098 |
15 | 921567e6 |
hex | 5d135d56 |
1561550166 has 48 divisors (see below), whose sum is σ = 3810014208. Its totient is φ = 457930800.
The previous prime is 1561550161. The next prime is 1561550167. The reversal of 1561550166 is 6610551651.
It is a Smith number, since the sum of its digits (36) coincides with the sum of the digits of its prime factors.
It is a self number, because there is not a number n which added to its sum of digits gives 1561550166.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1561550161) by changing a digit.
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 23 ways as a sum of consecutive naturals, for example, 121066 + ... + 133341.
It is an arithmetic number, because the mean of its divisors is an integer number (79375296).
Almost surely, 21561550166 is an apocalyptic number.
1561550166 is an abundant number, since it is smaller than the sum of its proper divisors (2248464042).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1561550166 is a wasteful number, since it uses less digits than its factorization.
1561550166 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 254457 (or 254454 counting only the distinct ones).
The product of its (nonzero) digits is 27000, while the sum is 36.
The square root of 1561550166 is about 39516.4543703000. The cubic root of 1561550166 is about 1160.1620280012.
The spelling of 1561550166 in words is "one billion, five hundred sixty-one million, five hundred fifty thousand, one hundred sixty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •