Base | Representation |
---|---|
bin | 100000111011101… |
… | …111100001000001 |
3 | 1102111200112110101 |
4 | 200323233201001 |
5 | 2112422011113 |
6 | 130454402401 |
7 | 16456305364 |
oct | 4073574101 |
9 | 1374615411 |
10 | 552532033 |
11 | 263987549 |
12 | 135060401 |
13 | 8a618b41 |
14 | 5354c0db |
15 | 337932dd |
hex | 20eef841 |
552532033 has 2 divisors, whose sum is σ = 552532034. Its totient is φ = 552532032.
The previous prime is 552531997. The next prime is 552532051. The reversal of 552532033 is 330235255.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 442345024 + 110187009 = 21032^2 + 10497^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-552532033 is a prime.
It is a super-2 number, since 2×5525320332 = 610583294982226178, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 552531992 and 552532010.
It is not a weakly prime, because it can be changed into another prime (552532093) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 276266016 + 276266017.
It is an arithmetic number, because the mean of its divisors is an integer number (276266017).
Almost surely, 2552532033 is an apocalyptic number.
It is an amenable number.
552532033 is a deficient number, since it is larger than the sum of its proper divisors (1).
552532033 is an equidigital number, since it uses as much as digits as its factorization.
552532033 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 13500, while the sum is 28.
The square root of 552532033 is about 23505.9999361865. Note that the first 4 decimals coincide. The cubic root of 552532033 is about 820.5766482259.
Adding to 552532033 its reverse (330235255), we get a palindrome (882767288).
The spelling of 552532033 in words is "five hundred fifty-two million, five hundred thirty-two thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •