Base | Representation |
---|---|
bin | 100111101101000… |
… | …0110000000110001 |
3 | 10102211211211022021 |
4 | 1033122012000301 |
5 | 10212023143213 |
6 | 340110311441 |
7 | 45004566616 |
oct | 11732060061 |
9 | 3384754267 |
10 | 1332240433 |
11 | 624018a57 |
12 | 3121b8581 |
13 | 183015964 |
14 | c8d1450d |
15 | 7be5cd8d |
hex | 4f686031 |
1332240433 has 2 divisors, whose sum is σ = 1332240434. Its totient is φ = 1332240432.
The previous prime is 1332240421. The next prime is 1332240443. The reversal of 1332240433 is 3340422331.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 912523264 + 419717169 = 30208^2 + 20487^2 .
It is a cyclic number.
It is not a de Polignac number, because 1332240433 - 29 = 1332239921 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1332240398 and 1332240407.
It is not a weakly prime, because it can be changed into another prime (1332240443) 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, 666120216 + 666120217.
It is an arithmetic number, because the mean of its divisors is an integer number (666120217).
Almost surely, 21332240433 is an apocalyptic number.
It is an amenable number.
1332240433 is a deficient number, since it is larger than the sum of its proper divisors (1).
1332240433 is an equidigital number, since it uses as much as digits as its factorization.
1332240433 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5184, while the sum is 25.
The square root of 1332240433 is about 36499.8689449702. The cubic root of 1332240433 is about 1100.3416109798.
Adding to 1332240433 its reverse (3340422331), we get a palindrome (4672662764).
The spelling of 1332240433 in words is "one billion, three hundred thirty-two million, two hundred forty thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •