Base | Representation |
---|---|
bin | 101110010010111… |
… | …0101111100000101 |
3 | 11000021001010022011 |
4 | 1130211311330011 |
5 | 11140134033013 |
6 | 414051134221 |
7 | 53331613222 |
oct | 13445657405 |
9 | 4007033264 |
10 | 1553424133 |
11 | 72795a5a8 |
12 | 3742a4371 |
13 | 1b9aa90a1 |
14 | 10a44c949 |
15 | 9159dc3d |
hex | 5c975f05 |
1553424133 has 2 divisors, whose sum is σ = 1553424134. Its totient is φ = 1553424132.
The previous prime is 1553424101. The next prime is 1553424139. The reversal of 1553424133 is 3314243551.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1528653604 + 24770529 = 39098^2 + 4977^2 .
It is a cyclic number.
It is not a de Polignac number, because 1553424133 - 25 = 1553424101 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1553424095 and 1553424104.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1553424139) 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, 776712066 + 776712067.
It is an arithmetic number, because the mean of its divisors is an integer number (776712067).
Almost surely, 21553424133 is an apocalyptic number.
It is an amenable number.
1553424133 is a deficient number, since it is larger than the sum of its proper divisors (1).
1553424133 is an equidigital number, since it uses as much as digits as its factorization.
1553424133 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 21600, while the sum is 31.
The square root of 1553424133 is about 39413.5019124158. The cubic root of 1553424133 is about 1158.1461005772.
Adding to 1553424133 its reverse (3314243551), we get a palindrome (4867667684).
The spelling of 1553424133 in words is "one billion, five hundred fifty-three million, four hundred twenty-four thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •