Base | Representation |
---|---|
bin | 100000111000101… |
… | …111001011010101 |
3 | 1102110012111202212 |
4 | 200320233023111 |
5 | 2112221303323 |
6 | 130425443205 |
7 | 16446514466 |
oct | 4070571325 |
9 | 1373174685 |
10 | 551744213 |
11 | 263499659 |
12 | 134940505 |
13 | 8a401387 |
14 | 533c4d6d |
15 | 33689b78 |
hex | 20e2f2d5 |
551744213 has 2 divisors, whose sum is σ = 551744214. Its totient is φ = 551744212.
The previous prime is 551744203. The next prime is 551744239. The reversal of 551744213 is 312447155.
551744213 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 551404324 + 339889 = 23482^2 + 583^2 .
It is a cyclic number.
It is not a de Polignac number, because 551744213 - 28 = 551743957 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 551744213.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (551744203) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 275872106 + 275872107.
It is an arithmetic number, because the mean of its divisors is an integer number (275872107).
Almost surely, 2551744213 is an apocalyptic number.
It is an amenable number.
551744213 is a deficient number, since it is larger than the sum of its proper divisors (1).
551744213 is an equidigital number, since it uses as much as digits as its factorization.
551744213 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 16800, while the sum is 32.
The square root of 551744213 is about 23489.2361093331. The cubic root of 551744213 is about 820.1864601754.
The spelling of 551744213 in words is "five hundred fifty-one million, seven hundred forty-four thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •