Base | Representation |
---|---|
bin | 1011101101010001… |
… | …0110101111110001 |
3 | 22010000111110020201 |
4 | 2323110112233301 |
5 | 22414011103231 |
6 | 1235502235201 |
7 | 140610205033 |
oct | 27324265761 |
9 | 8100443221 |
10 | 3142675441 |
11 | 1372a5a634 |
12 | 738585b01 |
13 | 3b111a589 |
14 | 21b545c53 |
15 | 135d78161 |
hex | bb516bf1 |
3142675441 has 2 divisors, whose sum is σ = 3142675442. Its totient is φ = 3142675440.
The previous prime is 3142675433. The next prime is 3142675447. The reversal of 3142675441 is 1445762413.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2696621041 + 446054400 = 51929^2 + 21120^2 .
It is an emirp because it is prime and its reverse (1445762413) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 3142675441 - 23 = 3142675433 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 3142675441.
It is not a weakly prime, because it can be changed into another prime (3142675447) 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, 1571337720 + 1571337721.
It is an arithmetic number, because the mean of its divisors is an integer number (1571337721).
Almost surely, 23142675441 is an apocalyptic number.
It is an amenable number.
3142675441 is a deficient number, since it is larger than the sum of its proper divisors (1).
3142675441 is an equidigital number, since it uses as much as digits as its factorization.
3142675441 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 80640, while the sum is 37.
The square root of 3142675441 is about 56059.5704674947. The cubic root of 3142675441 is about 1464.7601312597.
The spelling of 3142675441 in words is "three billion, one hundred forty-two million, six hundred seventy-five thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •