Base | Representation |
---|---|
bin | 101010001110… |
… | …011011011011 |
3 | 202211101000102 |
4 | 222032123123 |
5 | 10313203042 |
6 | 1033130015 |
7 | 163041365 |
oct | 52163333 |
9 | 22741012 |
10 | 11069147 |
11 | 6280461 |
12 | 385990b |
13 | 23a73bb |
14 | 1681d35 |
15 | e89b32 |
hex | a8e6db |
11069147 has 2 divisors, whose sum is σ = 11069148. Its totient is φ = 11069146.
The previous prime is 11069119. The next prime is 11069161. The reversal of 11069147 is 74196011.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 11069147 - 222 = 6874843 is a prime.
It is not a weakly prime, because it can be changed into another prime (11069117) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5534573 + 5534574.
It is an arithmetic number, because the mean of its divisors is an integer number (5534574).
Almost surely, 211069147 is an apocalyptic number.
11069147 is a deficient number, since it is larger than the sum of its proper divisors (1).
11069147 is an equidigital number, since it uses as much as digits as its factorization.
11069147 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1512, while the sum is 29.
The square root of 11069147 is about 3327.0327620870. The cubic root of 11069147 is about 222.8630407044.
The spelling of 11069147 in words is "eleven million, sixty-nine thousand, one hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •