Base | Representation |
---|---|
bin | 10100101111000011… |
… | …10101011111011101 |
3 | 1001201211010112020122 |
4 | 22113201311133131 |
5 | 140244313222221 |
6 | 5040344524325 |
7 | 542602555544 |
oct | 122741653735 |
9 | 31654115218 |
10 | 11132164061 |
11 | 47a28a8697 |
12 | 21a81806a5 |
13 | 1085420135 |
14 | 77867515b |
15 | 452498eab |
hex | 2978757dd |
11132164061 has 4 divisors (see below), whose sum is σ = 11132681724. Its totient is φ = 11131646400.
The previous prime is 11132164003. The next prime is 11132164067. The reversal of 11132164061 is 16046123111.
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 400240036 + 10731924025 = 20006^2 + 103595^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11132164061 is a prime.
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 11132164061.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11132164067) 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, 225110 + ... + 270071.
It is an arithmetic number, because the mean of its divisors is an integer number (2783170431).
Almost surely, 211132164061 is an apocalyptic number.
It is an amenable number.
11132164061 is a deficient number, since it is larger than the sum of its proper divisors (517663).
11132164061 is an equidigital number, since it uses as much as digits as its factorization.
11132164061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 517662.
The product of its (nonzero) digits is 864, while the sum is 26.
Adding to 11132164061 its reverse (16046123111), we get a palindrome (27178287172).
The spelling of 11132164061 in words is "eleven billion, one hundred thirty-two million, one hundred sixty-four thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.123 sec. • engine limits •