Base | Representation |
---|---|
bin | 1011110101000111010101 |
3 | 12211112222002 |
4 | 23311013111 |
5 | 1243214031 |
6 | 150245045 |
7 | 35234141 |
oct | 13650725 |
9 | 5745862 |
10 | 3101141 |
11 | 1828a2a |
12 | 1056785 |
13 | 8476c4 |
14 | 5aa221 |
15 | 413ccb |
hex | 2f51d5 |
3101141 has 2 divisors, whose sum is σ = 3101142. Its totient is φ = 3101140.
The previous prime is 3101069. The next prime is 3101143. The reversal of 3101141 is 1411013.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2992900 + 108241 = 1730^2 + 329^2 .
It is an emirp because it is prime and its reverse (1411013) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-3101141 is a prime.
It is a Sophie Germain prime.
Together with 3101143, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3101143) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a good prime.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1550570 + 1550571.
It is an arithmetic number, because the mean of its divisors is an integer number (1550571).
Almost surely, 23101141 is an apocalyptic number.
It is an amenable number.
3101141 is a deficient number, since it is larger than the sum of its proper divisors (1).
3101141 is an equidigital number, since it uses as much as digits as its factorization.
3101141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12, while the sum is 11.
The square root of 3101141 is about 1761.0056785826. The cubic root of 3101141 is about 145.8278605475.
Adding to 3101141 its reverse (1411013), we get a palindrome (4512154).
The spelling of 3101141 in words is "three million, one hundred one thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •