Base | Representation |
---|---|
bin | 10100100000100111… |
… | …10100110001000001 |
3 | 1001102101020022202110 |
4 | 22100103310301001 |
5 | 140022312104221 |
6 | 5020341005533 |
7 | 536602246140 |
oct | 122023646101 |
9 | 31371208673 |
10 | 11011050561 |
11 | 47404a6295 |
12 | 21736b38a9 |
13 | 10662c6444 |
14 | 766549757 |
15 | 446a23776 |
hex | 2904f4c41 |
11011050561 has 8 divisors (see below), whose sum is σ = 16778743744. Its totient is φ = 6292028880.
The previous prime is 11011050559. The next prime is 11011050577. The reversal of 11011050561 is 16505011011.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 11011050561 - 21 = 11011050559 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21), and also a Moran number because the ratio is a prime number: 524335741 = 11011050561 / (1 + 1 + 0 + 1 + 1 + 0 + 5 + 0 + 5 + 6 + 1).
It is not an unprimeable number, because it can be changed into a prime (11011050961) 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 7 ways as a sum of consecutive naturals, for example, 262167850 + ... + 262167891.
It is an arithmetic number, because the mean of its divisors is an integer number (2097342968).
Almost surely, 211011050561 is an apocalyptic number.
It is an amenable number.
11011050561 is a deficient number, since it is larger than the sum of its proper divisors (5767693183).
11011050561 is an equidigital number, since it uses as much as digits as its factorization.
11011050561 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 524335751.
The product of its (nonzero) digits is 150, while the sum is 21.
Adding to 11011050561 its reverse (16505011011), we get a palindrome (27516061572).
The spelling of 11011050561 in words is "eleven billion, eleven million, fifty thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •