Base | Representation |
---|---|
bin | 100000011100111100101 |
3 | 2000000201002 |
4 | 10003213211 |
5 | 233012042 |
6 | 34443045 |
7 | 12016166 |
oct | 4034745 |
9 | 2000632 |
10 | 1063397 |
11 | 666a45 |
12 | 433485 |
13 | 2b303a |
14 | 1d976d |
15 | 160132 |
hex | 1039e5 |
1063397 has 2 divisors, whose sum is σ = 1063398. Its totient is φ = 1063396.
The previous prime is 1063379. The next prime is 1063399. The reversal of 1063397 is 7933601.
Together with previous prime (1063379) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 923521 + 139876 = 961^2 + 374^2 .
It is a cyclic number.
It is not a de Polignac number, because 1063397 - 220 = 14821 is a prime.
It is a super-2 number, since 2×10633972 = 2261626359218, which contains 22 as substring.
Together with 1063399, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1063399) 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, 531698 + 531699.
It is an arithmetic number, because the mean of its divisors is an integer number (531699).
21063397 is an apocalyptic number.
It is an amenable number.
1063397 is a deficient number, since it is larger than the sum of its proper divisors (1).
1063397 is an equidigital number, since it uses as much as digits as its factorization.
1063397 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3402, while the sum is 29.
The square root of 1063397 is about 1031.2114235209. The cubic root of 1063397 is about 102.0700851149.
Adding to 1063397 its reverse (7933601), we get a palindrome (8996998).
The spelling of 1063397 in words is "one million, sixty-three thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •