Base | Representation |
---|---|
bin | 1100101101010011… |
… | …0001101010010101 |
3 | 22210201210222200202 |
4 | 3023110301222111 |
5 | 23441233034031 |
6 | 1322254150245 |
7 | 150350621066 |
oct | 31324615225 |
9 | 8721728622 |
10 | 3411221141 |
11 | 14a05aaa29 |
12 | 7b24b2385 |
13 | 424954463 |
14 | 24508c56d |
15 | 14e7222cb |
hex | cb531a95 |
3411221141 has 2 divisors, whose sum is σ = 3411221142. Its totient is φ = 3411221140.
The previous prime is 3411221129. The next prime is 3411221147. The reversal of 3411221141 is 1411221143.
3411221141 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3033696241 + 377524900 = 55079^2 + 19430^2 .
It is a cyclic number.
It is not a de Polignac number, because 3411221141 - 210 = 3411220117 is a prime.
It is a Sophie Germain 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 (3411221147) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1705610570 + 1705610571.
It is an arithmetic number, because the mean of its divisors is an integer number (1705610571).
Almost surely, 23411221141 is an apocalyptic number.
It is an amenable number.
3411221141 is a deficient number, since it is larger than the sum of its proper divisors (1).
3411221141 is an equidigital number, since it uses as much as digits as its factorization.
3411221141 is an evil number, because the sum of its binary digits is even.
The product of its digits is 192, while the sum is 20.
The square root of 3411221141 is about 58405.6601794723. The cubic root of 3411221141 is about 1505.3470119571.
Adding to 3411221141 its reverse (1411221143), we get a palindrome (4822442284).
The spelling of 3411221141 in words is "three billion, four hundred eleven million, two hundred twenty-one thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •