Base | Representation |
---|---|
bin | 1100111001100… |
… | …00110000100001 |
3 | 21112121021200001 |
4 | 12130300300201 |
5 | 210144444131 |
6 | 14423100001 |
7 | 2452465522 |
oct | 634606041 |
9 | 245537601 |
10 | 108203041 |
11 | 56094601 |
12 | 302a1601 |
13 | 1955648b |
14 | 10528849 |
15 | 9775261 |
hex | 6730c21 |
108203041 has 2 divisors, whose sum is σ = 108203042. Its totient is φ = 108203040.
The previous prime is 108203027. The next prime is 108203047. The reversal of 108203041 is 140302801.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 106172416 + 2030625 = 10304^2 + 1425^2 .
It is an emirp because it is prime and its reverse (140302801) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 108203041 - 29 = 108202529 is a prime.
It is not a weakly prime, because it can be changed into another prime (108203047) 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, 54101520 + 54101521.
It is an arithmetic number, because the mean of its divisors is an integer number (54101521).
Almost surely, 2108203041 is an apocalyptic number.
It is an amenable number.
108203041 is a deficient number, since it is larger than the sum of its proper divisors (1).
108203041 is an equidigital number, since it uses as much as digits as its factorization.
108203041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 192, while the sum is 19.
The square root of 108203041 is about 10402.0690730258. The cubic root of 108203041 is about 476.5185616343.
Adding to 108203041 its reverse (140302801), we get a palindrome (248505842).
It can be divided in two parts, 10820 and 3041, that added together give a triangular number (13861 = T166).
The spelling of 108203041 in words is "one hundred eight million, two hundred three thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •