Base | Representation |
---|---|
bin | 110011011110101010… |
… | …0111000100000100001 |
3 | 101120100110100211202121 |
4 | 1212331110320200201 |
5 | 3302401420104221 |
6 | 122441453544241 |
7 | 10662355114063 |
oct | 1467524704041 |
9 | 346313324677 |
10 | 110550550561 |
11 | 4297a9a3980 |
12 | 195131a5081 |
13 | a56a5a0b79 |
14 | 54ca377733 |
15 | 2d205e8a41 |
hex | 19bd538821 |
110550550561 has 4 divisors (see below), whose sum is σ = 120600600624. Its totient is φ = 100500500500.
The previous prime is 110550550541. The next prime is 110550550567. The reversal of 110550550561 is 165055055011.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 110550550561 - 29 = 110550550049 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (110550550567) 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 3 ways as a sum of consecutive naturals, for example, 5025025015 + ... + 5025025036.
It is an arithmetic number, because the mean of its divisors is an integer number (30150150156).
Almost surely, 2110550550561 is an apocalyptic number.
110550550561 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
110550550561 is a deficient number, since it is larger than the sum of its proper divisors (10050050063).
110550550561 is a wasteful number, since it uses less digits than its factorization.
110550550561 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10050050062.
The product of its (nonzero) digits is 18750, while the sum is 34.
The spelling of 110550550561 in words is "one hundred ten billion, five hundred fifty million, five hundred fifty thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •