Base | Representation |
---|---|
bin | 100001101000101000011 |
3 | 2001222212021 |
4 | 10031011003 |
5 | 240232042 |
6 | 35342311 |
7 | 12240154 |
oct | 4150503 |
9 | 2058767 |
10 | 1102147 |
11 | 693072 |
12 | 451997 |
13 | 2c7877 |
14 | 20992b |
15 | 16b867 |
hex | 10d143 |
1102147 has 2 divisors, whose sum is σ = 1102148. Its totient is φ = 1102146.
The previous prime is 1102117. The next prime is 1102151. The reversal of 1102147 is 7412011.
1102147 is nontrivially palindromic in base 5.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1102147 - 215 = 1069379 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1102147.
It is not a weakly prime, because it can be changed into another prime (1102117) by changing a digit.
It is a good prime.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 551073 + 551074.
It is an arithmetic number, because the mean of its divisors is an integer number (551074).
21102147 is an apocalyptic number.
1102147 is a deficient number, since it is larger than the sum of its proper divisors (1).
1102147 is an equidigital number, since it uses as much as digits as its factorization.
1102147 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 56, while the sum is 16.
The square root of 1102147 is about 1049.8318913045. The cubic root of 1102147 is about 103.2951286677.
Adding to 1102147 its reverse (7412011), we get a palindrome (8514158).
The spelling of 1102147 in words is "one million, one hundred two thousand, one hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •