Base | Representation |
---|---|
bin | 1001100000101011… |
… | …1101110011100101 |
3 | 20120220221102021212 |
4 | 2120022331303211 |
5 | 20212032331204 |
6 | 1101155521205 |
7 | 120160145003 |
oct | 23012756345 |
9 | 6526842255 |
10 | 2553011429 |
11 | 10a0121301 |
12 | 5b2bb9205 |
13 | 318c00467 |
14 | 1a30cda73 |
15 | ee1ecc6e |
hex | 982bdce5 |
2553011429 has 2 divisors, whose sum is σ = 2553011430. Its totient is φ = 2553011428.
The previous prime is 2553011413. The next prime is 2553011443. The reversal of 2553011429 is 9241103552.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2099747329 + 453264100 = 45823^2 + 21290^2 .
It is a cyclic number.
It is not a de Polignac number, because 2553011429 - 24 = 2553011413 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2553011395 and 2553011404.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2553010429) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1276505714 + 1276505715.
It is an arithmetic number, because the mean of its divisors is an integer number (1276505715).
Almost surely, 22553011429 is an apocalyptic number.
It is an amenable number.
2553011429 is a deficient number, since it is larger than the sum of its proper divisors (1).
2553011429 is an equidigital number, since it uses as much as digits as its factorization.
2553011429 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 2553011429 is about 50527.3334839669. Note that the first 3 decimals coincide. The cubic root of 2553011429 is about 1366.7348011705.
The spelling of 2553011429 in words is "two billion, five hundred fifty-three million, eleven thousand, four hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •