Base | Representation |
---|---|
bin | 1100010011011… |
… | …11001101111101 |
3 | 21012012220201201 |
4 | 12021233031331 |
5 | 202410402442 |
6 | 14124135501 |
7 | 2362215163 |
oct | 611571575 |
9 | 235186651 |
10 | 103215997 |
11 | 53298785 |
12 | 2a697591 |
13 | 184cb571 |
14 | d9cb233 |
15 | 90dc7b7 |
hex | 626f37d |
103215997 has 2 divisors, whose sum is σ = 103215998. Its totient is φ = 103215996.
The previous prime is 103215947. The next prime is 103216007. The reversal of 103215997 is 799512301.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 97990201 + 5225796 = 9899^2 + 2286^2 .
It is a cyclic number.
It is not a de Polignac number, because 103215997 - 27 = 103215869 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (103215907) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51607998 + 51607999.
It is an arithmetic number, because the mean of its divisors is an integer number (51607999).
Almost surely, 2103215997 is an apocalyptic number.
It is an amenable number.
103215997 is a deficient number, since it is larger than the sum of its proper divisors (1).
103215997 is an equidigital number, since it uses as much as digits as its factorization.
103215997 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 17010, while the sum is 37.
The square root of 103215997 is about 10159.5274004257. The cubic root of 103215997 is about 469.0822547026.
It can be divided in two parts, 1032159 and 97, that added together give a square (1032256 = 10162).
The spelling of 103215997 in words is "one hundred three million, two hundred fifteen thousand, nine hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •