Base | Representation |
---|---|
bin | 1011010101010100… |
… | …1000010101000001 |
3 | 21212000110112202021 |
4 | 2311111020111001 |
5 | 22212301341413 |
6 | 1221513121441 |
7 | 135250255111 |
oct | 26525102501 |
9 | 7760415667 |
10 | 3042215233 |
11 | 1321284372 |
12 | 70a9b9281 |
13 | 396375475 |
14 | 20c075041 |
15 | 12c13218d |
hex | b5548541 |
3042215233 has 2 divisors, whose sum is σ = 3042215234. Its totient is φ = 3042215232.
The previous prime is 3042215149. The next prime is 3042215237. The reversal of 3042215233 is 3325122403.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2978103184 + 64112049 = 54572^2 + 8007^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-3042215233 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 3042215198 and 3042215207.
It is not a weakly prime, because it can be changed into another prime (3042215237) 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, 1521107616 + 1521107617.
It is an arithmetic number, because the mean of its divisors is an integer number (1521107617).
Almost surely, 23042215233 is an apocalyptic number.
It is an amenable number.
3042215233 is a deficient number, since it is larger than the sum of its proper divisors (1).
3042215233 is an equidigital number, since it uses as much as digits as its factorization.
3042215233 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4320, while the sum is 25.
The square root of 3042215233 is about 55156.2800866773. The cubic root of 3042215233 is about 1448.9830734117.
Adding to 3042215233 its reverse (3325122403), we get a palindrome (6367337636).
The spelling of 3042215233 in words is "three billion, forty-two million, two hundred fifteen thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •