Base | Representation |
---|---|
bin | 100001000001000… |
… | …000111010111001 |
3 | 1102121021202012212 |
4 | 201001000322321 |
5 | 2113300222131 |
6 | 130544144505 |
7 | 16504122512 |
oct | 4101007271 |
9 | 1377252185 |
10 | 553914041 |
11 | 2647408aa |
12 | 135608135 |
13 | 8a9b0bb5 |
14 | 537cba09 |
15 | 33967a2b |
hex | 21040eb9 |
553914041 has 2 divisors, whose sum is σ = 553914042. Its totient is φ = 553914040.
The previous prime is 553914019. The next prime is 553914073. The reversal of 553914041 is 140419355.
It is an a-pointer prime, because the next prime (553914073) can be obtained adding 553914041 to its sum of digits (32).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 399160441 + 154753600 = 19979^2 + 12440^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-553914041 is a prime.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 553913989 and 553914007.
It is not a weakly prime, because it can be changed into another prime (553914091) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 276957020 + 276957021.
It is an arithmetic number, because the mean of its divisors is an integer number (276957021).
Almost surely, 2553914041 is an apocalyptic number.
It is an amenable number.
553914041 is a deficient number, since it is larger than the sum of its proper divisors (1).
553914041 is an equidigital number, since it uses as much as digits as its factorization.
553914041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10800, while the sum is 32.
The square root of 553914041 is about 23535.3784970627. The cubic root of 553914041 is about 821.2602280827.
The spelling of 553914041 in words is "five hundred fifty-three million, nine hundred fourteen thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •