Base | Representation |
---|---|
bin | 10100100101011001… |
… | …10101000111111101 |
3 | 1001112011201002122111 |
4 | 22102230311013331 |
5 | 140113044110221 |
6 | 5024332414021 |
7 | 540600211354 |
oct | 122254650775 |
9 | 31464632574 |
10 | 11051160061 |
11 | 4761101137 |
12 | 2185017311 |
13 | 10716caa86 |
14 | 76b9ca99b |
15 | 44a2e7be1 |
hex | 292b351fd |
11051160061 has 4 divisors (see below), whose sum is σ = 11054562624. Its totient is φ = 11047757500.
The previous prime is 11051160059. The next prime is 11051160091. The reversal of 11051160061 is 16006115011.
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 11051160061 - 21 = 11051160059 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11051160031) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1696405 + ... + 1702906.
It is an arithmetic number, because the mean of its divisors is an integer number (2763640656).
Almost surely, 211051160061 is an apocalyptic number.
It is an amenable number.
11051160061 is a deficient number, since it is larger than the sum of its proper divisors (3402563).
11051160061 is an equidigital number, since it uses as much as digits as its factorization.
11051160061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3402562.
The product of its (nonzero) digits is 180, while the sum is 22.
Multiplying 11051160061 by its sum of digits (22), we get a palindrome (243125521342).
Adding to 11051160061 its reverse (16006115011), we get a palindrome (27057275072).
The spelling of 11051160061 in words is "eleven billion, fifty-one million, one hundred sixty thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •