Base | Representation |
---|---|
bin | 1100010000100… |
… | …11101100100111 |
3 | 21011111212111122 |
4 | 12020103230213 |
5 | 202311404002 |
6 | 14112124155 |
7 | 2356064234 |
oct | 610235447 |
9 | 234455448 |
10 | 102841127 |
11 | 53062074 |
12 | 2a53665b |
13 | 183c9a4c |
14 | d93078b |
15 | 90666a2 |
hex | 6213b27 |
102841127 has 2 divisors, whose sum is σ = 102841128. Its totient is φ = 102841126.
The previous prime is 102841069. The next prime is 102841139. The reversal of 102841127 is 721148201.
It is a strong prime.
It is an emirp because it is prime and its reverse (721148201) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-102841127 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 102841096 and 102841105.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (102841327) 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, 51420563 + 51420564.
It is an arithmetic number, because the mean of its divisors is an integer number (51420564).
Almost surely, 2102841127 is an apocalyptic number.
102841127 is a deficient number, since it is larger than the sum of its proper divisors (1).
102841127 is an equidigital number, since it uses as much as digits as its factorization.
102841127 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 896, while the sum is 26.
The square root of 102841127 is about 10141.0614335976. The cubic root of 102841127 is about 468.5136794685.
Adding to 102841127 its reverse (721148201), we get a palindrome (823989328).
It can be divided in two parts, 10284 and 1127, that added together give a palindrome (11411).
The spelling of 102841127 in words is "one hundred two million, eight hundred forty-one thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •