Base | Representation |
---|---|
bin | 1100001000000100… |
… | …0010110010000001 |
3 | 22101211221211212212 |
4 | 3002001002302001 |
5 | 23131243202231 |
6 | 1254555031505 |
7 | 143443332503 |
oct | 30201026201 |
9 | 8354854785 |
10 | 3255053441 |
11 | 1420435912 |
12 | 76a13b595 |
13 | 3cb4a6133 |
14 | 22c439d73 |
15 | 140b7542b |
hex | c2042c81 |
3255053441 has 2 divisors, whose sum is σ = 3255053442. Its totient is φ = 3255053440.
The previous prime is 3255053437. The next prime is 3255053443. The reversal of 3255053441 is 1443505523.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3035569216 + 219484225 = 55096^2 + 14815^2 .
It is a cyclic number.
It is not a de Polignac number, because 3255053441 - 22 = 3255053437 is a prime.
Together with 3255053443, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 3255053398 and 3255053407.
It is not a weakly prime, because it can be changed into another prime (3255053443) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1627526720 + 1627526721.
It is an arithmetic number, because the mean of its divisors is an integer number (1627526721).
Almost surely, 23255053441 is an apocalyptic number.
It is an amenable number.
3255053441 is a deficient number, since it is larger than the sum of its proper divisors (1).
3255053441 is an equidigital number, since it uses as much as digits as its factorization.
3255053441 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 36000, while the sum is 32.
The square root of 3255053441 is about 57053.0756489078. The cubic root of 3255053441 is about 1482.0153699165.
Adding to 3255053441 its reverse (1443505523), we get a palindrome (4698558964).
The spelling of 3255053441 in words is "three billion, two hundred fifty-five million, fifty-three thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •