Base | Representation |
---|---|
bin | 1011101101101010… |
… | …0101111010101001 |
3 | 22010010120112001021 |
4 | 2323122211322221 |
5 | 22414420413231 |
6 | 1240001252441 |
7 | 140630124556 |
oct | 27332457251 |
9 | 8103515037 |
10 | 3144310441 |
11 | 1373976a78 |
12 | 739034121 |
13 | 3b157082c |
14 | 21b84da2d |
15 | 13609c811 |
hex | bb6a5ea9 |
3144310441 has 2 divisors, whose sum is σ = 3144310442. Its totient is φ = 3144310440.
The previous prime is 3144310369. The next prime is 3144310493. The reversal of 3144310441 is 1440134413.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3125257216 + 19053225 = 55904^2 + 4365^2 .
It is a cyclic number.
It is not a de Polignac number, because 3144310441 - 27 = 3144310313 is a prime.
It is a super-2 number, since 2×31443104412 = 19773376298763228962, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (3144311441) 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, 1572155220 + 1572155221.
It is an arithmetic number, because the mean of its divisors is an integer number (1572155221).
Almost surely, 23144310441 is an apocalyptic number.
It is an amenable number.
3144310441 is a deficient number, since it is larger than the sum of its proper divisors (1).
3144310441 is an equidigital number, since it uses as much as digits as its factorization.
3144310441 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2304, while the sum is 25.
The square root of 3144310441 is about 56074.1512731134. The cubic root of 3144310441 is about 1465.0141046295.
Adding to 3144310441 its reverse (1440134413), we get a palindrome (4584444854).
The spelling of 3144310441 in words is "three billion, one hundred forty-four million, three hundred ten thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •