Base | Representation |
---|---|
bin | 1100000101001100… |
… | …1010010011100001 |
3 | 22101000022202211111 |
4 | 3001103022103201 |
5 | 23120203310013 |
6 | 1253445143321 |
7 | 143236156141 |
oct | 30123122341 |
9 | 8330282744 |
10 | 3243025633 |
11 | 1414670181 |
12 | 7660bab41 |
13 | 3c8b545a3 |
14 | 22a9c8921 |
15 | 13ea9b73d |
hex | c14ca4e1 |
3243025633 has 2 divisors, whose sum is σ = 3243025634. Its totient is φ = 3243025632.
The previous prime is 3243025619. The next prime is 3243025637. The reversal of 3243025633 is 3365203423.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2151846544 + 1091179089 = 46388^2 + 33033^2 .
It is an emirp because it is prime and its reverse (3365203423) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 3243025633 - 213 = 3243017441 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 3243025595 and 3243025604.
It is not a weakly prime, because it can be changed into another prime (3243025637) 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, 1621512816 + 1621512817.
It is an arithmetic number, because the mean of its divisors is an integer number (1621512817).
Almost surely, 23243025633 is an apocalyptic number.
It is an amenable number.
3243025633 is a deficient number, since it is larger than the sum of its proper divisors (1).
3243025633 is an equidigital number, since it uses as much as digits as its factorization.
3243025633 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 38880, while the sum is 31.
The square root of 3243025633 is about 56947.5691579544. The cubic root of 3243025633 is about 1480.1877094824.
The spelling of 3243025633 in words is "three billion, two hundred forty-three million, twenty-five thousand, six hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •