Base | Representation |
---|---|
bin | 101011010010… |
… | …110001010001 |
3 | 210100121000001 |
4 | 223102301101 |
5 | 10401132243 |
6 | 1043130001 |
7 | 165315451 |
oct | 53226121 |
9 | 23317001 |
10 | 11349073 |
11 | 64517aa |
12 | 3973901 |
13 | 2474938 |
14 | 1715d61 |
15 | ee2a4d |
hex | ad2c51 |
11349073 has 2 divisors, whose sum is σ = 11349074. Its totient is φ = 11349072.
The previous prime is 11349071. The next prime is 11349077. The reversal of 11349073 is 37094311.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10870209 + 478864 = 3297^2 + 692^2 .
It is an emirp because it is prime and its reverse (37094311) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11349073 - 21 = 11349071 is a prime.
Together with 11349071, it forms a pair of twin primes.
It is equal to p748009 and since 11349073 and 748009 have the same sum of digits, it is a Honaker prime.
It is not a weakly prime, because it can be changed into another prime (11349071) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5674536 + 5674537.
It is an arithmetic number, because the mean of its divisors is an integer number (5674537).
Almost surely, 211349073 is an apocalyptic number.
It is an amenable number.
11349073 is a deficient number, since it is larger than the sum of its proper divisors (1).
11349073 is an equidigital number, since it uses as much as digits as its factorization.
11349073 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2268, while the sum is 28.
The square root of 11349073 is about 3368.8385238833. The cubic root of 11349073 is about 224.7260732269.
The spelling of 11349073 in words is "eleven million, three hundred forty-nine thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •