Base | Representation |
---|---|
bin | 1011100101110000… |
… | …0011111101100101 |
3 | 22000211011100102122 |
4 | 2321130003331211 |
5 | 22332423004341 |
6 | 1232414315325 |
7 | 140045156366 |
oct | 27134037545 |
9 | 8024140378 |
10 | 3111141221 |
11 | 13571814a1 |
12 | 729ab8b45 |
13 | 3a7729186 |
14 | 217297b6d |
15 | 1331e994b |
hex | b9703f65 |
3111141221 has 2 divisors, whose sum is σ = 3111141222. Its totient is φ = 3111141220.
The previous prime is 3111141217. The next prime is 3111141223. The reversal of 3111141221 is 1221411113.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2957728225 + 153412996 = 54385^2 + 12386^2 .
It is a cyclic number.
It is not a de Polignac number, because 3111141221 - 22 = 3111141217 is a prime.
Together with 3111141223, 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 3111141221.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3111141223) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1555570610 + 1555570611.
It is an arithmetic number, because the mean of its divisors is an integer number (1555570611).
Almost surely, 23111141221 is an apocalyptic number.
It is an amenable number.
3111141221 is a deficient number, since it is larger than the sum of its proper divisors (1).
3111141221 is an equidigital number, since it uses as much as digits as its factorization.
3111141221 is an evil number, because the sum of its binary digits is even.
The product of its digits is 48, while the sum is 17.
The square root of 3111141221 is about 55777.6050131233. The cubic root of 3111141221 is about 1459.8444228106.
Adding to 3111141221 its reverse (1221411113), we get a palindrome (4332552334).
The spelling of 3111141221 in words is "three billion, one hundred eleven million, one hundred forty-one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •