Base | Representation |
---|---|
bin | 1100000101001111… |
… | …1111111010110001 |
3 | 22101000201221001211 |
4 | 3001103333322301 |
5 | 23120232321413 |
6 | 1253454000121 |
7 | 143241062314 |
oct | 30123777261 |
9 | 8330657054 |
10 | 3243245233 |
11 | 1414800168 |
12 | 7661a6041 |
13 | 3c8c00527 |
14 | 22aa4497b |
15 | 13eae183d |
hex | c14ffeb1 |
3243245233 has 2 divisors, whose sum is σ = 3243245234. Its totient is φ = 3243245232.
The previous prime is 3243245177. The next prime is 3243245237. The reversal of 3243245233 is 3325423423.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1793691904 + 1449553329 = 42352^2 + 38073^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-3243245233 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 3243245195 and 3243245204.
It is not a weakly prime, because it can be changed into another prime (3243245237) 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, 1621622616 + 1621622617.
It is an arithmetic number, because the mean of its divisors is an integer number (1621622617).
Almost surely, 23243245233 is an apocalyptic number.
It is an amenable number.
3243245233 is a deficient number, since it is larger than the sum of its proper divisors (1).
3243245233 is an equidigital number, since it uses as much as digits as its factorization.
3243245233 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 51840, while the sum is 31.
The square root of 3243245233 is about 56949.4972146375. The cubic root of 3243245233 is about 1480.2211188066.
Adding to 3243245233 its reverse (3325423423), we get a palindrome (6568668656).
The spelling of 3243245233 in words is "three billion, two hundred forty-three million, two hundred forty-five thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •