Base | Representation |
---|---|
bin | 100000110110000… |
… | …001110010111001 |
3 | 1102101212102121012 |
4 | 200312001302321 |
5 | 2112031042131 |
6 | 130402323305 |
7 | 16440466145 |
oct | 4066016271 |
9 | 1371772535 |
10 | 551034041 |
11 | 263054038 |
12 | 134659535 |
13 | 8a21305c |
14 | 5327c225 |
15 | 3359952b |
hex | 20d81cb9 |
551034041 has 2 divisors, whose sum is σ = 551034042. Its totient is φ = 551034040.
The previous prime is 551034031. The next prime is 551034061. The reversal of 551034041 is 140430155.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 526243600 + 24790441 = 22940^2 + 4979^2 .
It is a cyclic number.
It is not a de Polignac number, because 551034041 - 214 = 551017657 is a prime.
It is a Sophie Germain prime.
It is a Chen prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 551033998 and 551034016.
It is not a weakly prime, because it can be changed into another prime (551034031) 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, 275517020 + 275517021.
It is an arithmetic number, because the mean of its divisors is an integer number (275517021).
Almost surely, 2551034041 is an apocalyptic number.
It is an amenable number.
551034041 is a deficient number, since it is larger than the sum of its proper divisors (1).
551034041 is an equidigital number, since it uses as much as digits as its factorization.
551034041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1200, while the sum is 23.
The square root of 551034041 is about 23474.1142750903. The cubic root of 551034041 is about 819.8344108427.
Adding to 551034041 its reverse (140430155), we get a palindrome (691464196).
The spelling of 551034041 in words is "five hundred fifty-one million, thirty-four thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •