Base | Representation |
---|---|
bin | 1011101000100111… |
… | …0000111111011101 |
3 | 22001122201001011102 |
4 | 2322021300333131 |
5 | 22344004402031 |
6 | 1233523202445 |
7 | 140252046236 |
oct | 27211607735 |
9 | 8048631142 |
10 | 3123122141 |
11 | 1362a14987 |
12 | 731b16425 |
13 | 3aa062589 |
14 | 218ad608d |
15 | 1342b47cb |
hex | ba270fdd |
3123122141 has 2 divisors, whose sum is σ = 3123122142. Its totient is φ = 3123122140.
The previous prime is 3123122083. The next prime is 3123122147. The reversal of 3123122141 is 1412213213.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2778871225 + 344250916 = 52715^2 + 18554^2 .
It is a cyclic number.
It is not a de Polignac number, because 3123122141 - 210 = 3123121117 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 (3123122147) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1561561070 + 1561561071.
It is an arithmetic number, because the mean of its divisors is an integer number (1561561071).
Almost surely, 23123122141 is an apocalyptic number.
It is an amenable number.
3123122141 is a deficient number, since it is larger than the sum of its proper divisors (1).
3123122141 is an equidigital number, since it uses as much as digits as its factorization.
3123122141 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 288, while the sum is 20.
The square root of 3123122141 is about 55884.9008319779. The cubic root of 3123122141 is about 1461.7159628000.
Adding to 3123122141 its reverse (1412213213), we get a palindrome (4535335354).
The spelling of 3123122141 in words is "three billion, one hundred twenty-three million, one hundred twenty-two thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •