Base | Representation |
---|---|
bin | 11110110100111011… |
… | …01010001101101101 |
3 | 1120201101221200221022 |
4 | 33122131222031231 |
5 | 232343312010221 |
6 | 11334130143525 |
7 | 1124061420512 |
oct | 173235521555 |
9 | 46641850838 |
10 | 16550110061 |
11 | 7023118711 |
12 | 325a721ba5 |
13 | 1739a34844 |
14 | b3004d309 |
15 | 66ce5b4ab |
hex | 3da76a36d |
16550110061 has 4 divisors (see below), whose sum is σ = 16953771324. Its totient is φ = 16146448800.
The previous prime is 16550110039. The next prime is 16550110097. The reversal of 16550110061 is 16001105561.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 7738720900 + 8811389161 = 87970^2 + 93869^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-16550110061 is a prime.
It is a super-2 number, since 2×165501100612 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 16550110061.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (16550110361) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 201830570 + ... + 201830651.
It is an arithmetic number, because the mean of its divisors is an integer number (4238442831).
Almost surely, 216550110061 is an apocalyptic number.
It is an amenable number.
16550110061 is a deficient number, since it is larger than the sum of its proper divisors (403661263).
16550110061 is an equidigital number, since it uses as much as digits as its factorization.
16550110061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 403661262.
The product of its (nonzero) digits is 900, while the sum is 26.
The spelling of 16550110061 in words is "sixteen billion, five hundred fifty million, one hundred ten thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •