Base | Representation |
---|---|
bin | 100000111010001… |
… | …011111010000001 |
3 | 1102110220210210021 |
4 | 200322023322001 |
5 | 2112320432113 |
6 | 130441533441 |
7 | 16452656026 |
oct | 4072137201 |
9 | 1373823707 |
10 | 552124033 |
11 | 263728a5a |
12 | 134aa4281 |
13 | 8a505216 |
14 | 5348354d |
15 | 3371248d |
hex | 20e8be81 |
552124033 has 2 divisors, whose sum is σ = 552124034. Its totient is φ = 552124032.
The previous prime is 552124031. The next prime is 552124037. The reversal of 552124033 is 330421255.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 393943104 + 158180929 = 19848^2 + 12577^2 .
It is a cyclic number.
It is not a de Polignac number, because 552124033 - 21 = 552124031 is a prime.
Together with 552124031, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 552123989 and 552124007.
It is not a weakly prime, because it can be changed into another prime (552124031) 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, 276062016 + 276062017.
It is an arithmetic number, because the mean of its divisors is an integer number (276062017).
Almost surely, 2552124033 is an apocalyptic number.
It is an amenable number.
552124033 is a deficient number, since it is larger than the sum of its proper divisors (1).
552124033 is an equidigital number, since it uses as much as digits as its factorization.
552124033 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3600, while the sum is 25.
The square root of 552124033 is about 23497.3196982124. The cubic root of 552124033 is about 820.3746221033.
Adding to 552124033 its reverse (330421255), we get a palindrome (882545288).
The spelling of 552124033 in words is "five hundred fifty-two million, one hundred twenty-four thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •