Base | Representation |
---|---|
bin | 1001100000101111… |
… | …0001100100001001 |
3 | 20120221100012002212 |
4 | 2120023301210021 |
5 | 20212111122213 |
6 | 1101204234505 |
7 | 120162020045 |
oct | 23013614411 |
9 | 6527305085 |
10 | 2553223433 |
11 | 10a0256612 |
12 | 5b309ba35 |
13 | 318c75ac7 |
14 | 1a3147025 |
15 | ee2409a8 |
hex | 982f1909 |
2553223433 has 2 divisors, whose sum is σ = 2553223434. Its totient is φ = 2553223432.
The previous prime is 2553223417. The next prime is 2553223483. The reversal of 2553223433 is 3343223552.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2074620304 + 478603129 = 45548^2 + 21877^2 .
It is a cyclic number.
It is not a de Polignac number, because 2553223433 - 24 = 2553223417 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2553223433.
It is not a weakly prime, because it can be changed into another prime (2553223483) 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, 1276611716 + 1276611717.
It is an arithmetic number, because the mean of its divisors is an integer number (1276611717).
Almost surely, 22553223433 is an apocalyptic number.
It is an amenable number.
2553223433 is a deficient number, since it is larger than the sum of its proper divisors (1).
2553223433 is an equidigital number, since it uses as much as digits as its factorization.
2553223433 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 64800, while the sum is 32.
The square root of 2553223433 is about 50529.4313544097. The cubic root of 2553223433 is about 1366.7726316872.
Adding to 2553223433 its reverse (3343223552), we get a palindrome (5896446985).
The spelling of 2553223433 in words is "two billion, five hundred fifty-three million, two hundred twenty-three thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •