Base | Representation |
---|---|
bin | 1100001010101011… |
… | …1101000011110101 |
3 | 22102121122000200102 |
4 | 3002222331003311 |
5 | 23142101240203 |
6 | 1300030323445 |
7 | 143635611443 |
oct | 30252750365 |
9 | 8377560612 |
10 | 3266040053 |
11 | 142665a261 |
12 | 771959585 |
13 | 400851aa3 |
14 | 22da99b93 |
15 | 141ae5888 |
hex | c2abd0f5 |
3266040053 has 2 divisors, whose sum is σ = 3266040054. Its totient is φ = 3266040052.
The previous prime is 3266040023. The next prime is 3266040067. The reversal of 3266040053 is 3500406623.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3210582244 + 55457809 = 56662^2 + 7447^2 .
It is a cyclic number.
It is not a de Polignac number, because 3266040053 - 212 = 3266035957 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 3266039998 and 3266040025.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3266040023) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1633020026 + 1633020027.
It is an arithmetic number, because the mean of its divisors is an integer number (1633020027).
Almost surely, 23266040053 is an apocalyptic number.
It is an amenable number.
3266040053 is a deficient number, since it is larger than the sum of its proper divisors (1).
3266040053 is an equidigital number, since it uses as much as digits as its factorization.
3266040053 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12960, while the sum is 29.
The square root of 3266040053 is about 57149.2786743630. The cubic root of 3266040053 is about 1483.6808871860.
Adding to 3266040053 its reverse (3500406623), we get a palindrome (6766446676).
The spelling of 3266040053 in words is "three billion, two hundred sixty-six million, forty thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •