Base | Representation |
---|---|
bin | 101011000001… |
… | …111100000101 |
3 | 210020002102201 |
4 | 223001330011 |
5 | 10341431013 |
6 | 1041434501 |
7 | 164610454 |
oct | 53017405 |
9 | 23202381 |
10 | 11280133 |
11 | 6404a27 |
12 | 393ba31 |
13 | 244c447 |
14 | 16d8b9b |
15 | ecc3dd |
hex | ac1f05 |
11280133 has 2 divisors, whose sum is σ = 11280134. Its totient is φ = 11280132.
The previous prime is 11280077. The next prime is 11280161. The reversal of 11280133 is 33108211.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11276164 + 3969 = 3358^2 + 63^2 .
It is an emirp because it is prime and its reverse (33108211) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11280133 - 221 = 9182981 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11280133.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11280193) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a good prime.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5640066 + 5640067.
It is an arithmetic number, because the mean of its divisors is an integer number (5640067).
Almost surely, 211280133 is an apocalyptic number.
It is an amenable number.
11280133 is a deficient number, since it is larger than the sum of its proper divisors (1).
11280133 is an equidigital number, since it uses as much as digits as its factorization.
11280133 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 144, while the sum is 19.
The square root of 11280133 is about 3358.5909247778. The cubic root of 11280133 is about 224.2701155238.
Adding to 11280133 its reverse (33108211), we get a palindrome (44388344).
The spelling of 11280133 in words is "eleven million, two hundred eighty thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •