Base | Representation |
---|---|
bin | 101000000101… |
… | …001110011011 |
3 | 201202211010012 |
4 | 220011032123 |
5 | 10142212123 |
6 | 1013112135 |
7 | 155211062 |
oct | 50051633 |
9 | 21684105 |
10 | 10507163 |
11 | 5a27207 |
12 | 362864b |
13 | 223b674 |
14 | 15771d9 |
15 | dc8378 |
hex | a0539b |
10507163 has 2 divisors, whose sum is σ = 10507164. Its totient is φ = 10507162.
The previous prime is 10507153. The next prime is 10507169. The reversal of 10507163 is 36170501.
10507163 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is an emirp because it is prime and its reverse (36170501) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10507163 - 26 = 10507099 is a prime.
It is a super-2 number, since 2×105071632 = 220800948617138, which contains 22 as substring.
It is a Sophie Germain prime.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (10507169) 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, 5253581 + 5253582.
It is an arithmetic number, because the mean of its divisors is an integer number (5253582).
Almost surely, 210507163 is an apocalyptic number.
10507163 is a deficient number, since it is larger than the sum of its proper divisors (1).
10507163 is an equidigital number, since it uses as much as digits as its factorization.
10507163 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 630, while the sum is 23.
The square root of 10507163 is about 3241.4754356620. The cubic root of 10507163 is about 219.0257401130.
Adding to 10507163 its reverse (36170501), we get a palindrome (46677664).
The spelling of 10507163 in words is "ten million, five hundred seven thousand, one hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.169 sec. • engine limits •