Base | Representation |
---|---|
bin | 101000101011… |
… | …010100011001 |
3 | 202001202011002 |
4 | 220223110121 |
5 | 10212210233 |
6 | 1020314345 |
7 | 156431012 |
oct | 50532431 |
9 | 22052132 |
10 | 10663193 |
11 | 6023462 |
12 | 36a29b5 |
13 | 22946a8 |
14 | 15b8009 |
15 | e096e8 |
hex | a2b519 |
10663193 has 2 divisors, whose sum is σ = 10663194. Its totient is φ = 10663192.
The previous prime is 10663189. The next prime is 10663217. The reversal of 10663193 is 39136601.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10163344 + 499849 = 3188^2 + 707^2 .
It is a cyclic number.
It is not a de Polignac number, because 10663193 - 22 = 10663189 is a prime.
It is a super-3 number, since 3×106631933 (a number of 22 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Sophie Germain prime.
It is a Chen prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (10663153) 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, 5331596 + 5331597.
It is an arithmetic number, because the mean of its divisors is an integer number (5331597).
Almost surely, 210663193 is an apocalyptic number.
It is an amenable number.
10663193 is a deficient number, since it is larger than the sum of its proper divisors (1).
10663193 is an equidigital number, since it uses as much as digits as its factorization.
10663193 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2916, while the sum is 29.
The square root of 10663193 is about 3265.4544859789. The cubic root of 10663193 is about 220.1045852598.
Adding to 10663193 its reverse (39136601), we get a palindrome (49799794).
The spelling of 10663193 in words is "ten million, six hundred sixty-three thousand, one hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •