Base | Representation |
---|---|
bin | 1100101101000… |
… | …00100110011101 |
3 | 21102112000022201 |
4 | 12112200212131 |
5 | 204240021442 |
6 | 14324011501 |
7 | 2432531131 |
oct | 626404635 |
9 | 242460281 |
10 | 106563997 |
11 | 55175121 |
12 | 2b830b91 |
13 | 19101427 |
14 | 1021d3c1 |
15 | 954e7b7 |
hex | 65a099d |
106563997 has 2 divisors, whose sum is σ = 106563998. Its totient is φ = 106563996.
The previous prime is 106563983. The next prime is 106564039. The reversal of 106563997 is 799365601.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 57927321 + 48636676 = 7611^2 + 6974^2 .
It is an emirp because it is prime and its reverse (799365601) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-106563997 is a prime.
It is a super-2 number, since 2×1065639972 = 22711770913232018, which contains 22 as substring.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (106563937) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 53281998 + 53281999.
It is an arithmetic number, because the mean of its divisors is an integer number (53281999).
Almost surely, 2106563997 is an apocalyptic number.
It is an amenable number.
106563997 is a deficient number, since it is larger than the sum of its proper divisors (1).
106563997 is an equidigital number, since it uses as much as digits as its factorization.
106563997 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 306180, while the sum is 46.
The square root of 106563997 is about 10322.9839193907. The cubic root of 106563997 is about 474.1002313155.
The spelling of 106563997 in words is "one hundred six million, five hundred sixty-three thousand, nine hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •