Base | Representation |
---|---|
bin | 1100000001001001… |
… | …1101101010000101 |
3 | 22022211102002221221 |
4 | 3000102131222011 |
5 | 23101333044131 |
6 | 1252041440341 |
7 | 142642050616 |
oct | 30022355205 |
9 | 8284362857 |
10 | 3226065541 |
11 | 1406036876 |
12 | 7604a00b1 |
13 | 3c5496a2a |
14 | 228651c0d |
15 | 13d34b411 |
hex | c049da85 |
3226065541 has 2 divisors, whose sum is σ = 3226065542. Its totient is φ = 3226065540.
The previous prime is 3226065539. The next prime is 3226065547. The reversal of 3226065541 is 1455606223.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2422116225 + 803949316 = 49215^2 + 28354^2 .
It is a cyclic number.
It is not a de Polignac number, because 3226065541 - 21 = 3226065539 is a prime.
Together with 3226065539, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 3226065497 and 3226065506.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3226065547) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1613032770 + 1613032771.
It is an arithmetic number, because the mean of its divisors is an integer number (1613032771).
Almost surely, 23226065541 is an apocalyptic number.
It is an amenable number.
3226065541 is a deficient number, since it is larger than the sum of its proper divisors (1).
3226065541 is an equidigital number, since it uses as much as digits as its factorization.
3226065541 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 43200, while the sum is 34.
The square root of 3226065541 is about 56798.4642486045. The cubic root of 3226065541 is about 1477.6028794901.
The spelling of 3226065541 in words is "three billion, two hundred twenty-six million, sixty-five thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •