Base | Representation |
---|---|
bin | 1100010001000… |
… | …10111101011001 |
3 | 21011122001020222 |
4 | 12020202331121 |
5 | 202320404031 |
6 | 14113325425 |
7 | 2356444421 |
oct | 610427531 |
9 | 234561228 |
10 | 102903641 |
11 | 530a5035 |
12 | 2a566875 |
13 | 1841c339 |
14 | d949481 |
15 | 9079e7b |
hex | 6222f59 |
102903641 has 2 divisors, whose sum is σ = 102903642. Its totient is φ = 102903640.
The previous prime is 102903617. The next prime is 102903643. The reversal of 102903641 is 146309201.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 96452041 + 6451600 = 9821^2 + 2540^2 .
It is a cyclic number.
It is not a de Polignac number, because 102903641 - 210 = 102902617 is a prime.
Together with 102903643, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 102903641.
It is not a weakly prime, because it can be changed into another prime (102903643) 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, 51451820 + 51451821.
It is an arithmetic number, because the mean of its divisors is an integer number (51451821).
Almost surely, 2102903641 is an apocalyptic number.
It is an amenable number.
102903641 is a deficient number, since it is larger than the sum of its proper divisors (1).
102903641 is an equidigital number, since it uses as much as digits as its factorization.
102903641 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1296, while the sum is 26.
The square root of 102903641 is about 10144.1431870809. The cubic root of 102903641 is about 468.6085919886.
It can be divided in two parts, 10290 and 3641, that added together give a palindrome (13931).
The spelling of 102903641 in words is "one hundred two million, nine hundred three thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.103 sec. • engine limits •