Base | Representation |
---|---|
bin | 101110010011000… |
… | …1011101010110101 |
3 | 11000021012122101202 |
4 | 1130212023222311 |
5 | 11140144410031 |
6 | 414053102245 |
7 | 53332433555 |
oct | 13446135265 |
9 | 4007178352 |
10 | 1553513141 |
11 | 727a10464 |
12 | 374327985 |
13 | 1b9b0a75b |
14 | 10a473165 |
15 | 915ba2cb |
hex | 5c98bab5 |
1553513141 has 2 divisors, whose sum is σ = 1553513142. Its totient is φ = 1553513140.
The previous prime is 1553513119. The next prime is 1553513147. The reversal of 1553513141 is 1413153551.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 976312516 + 577200625 = 31246^2 + 24025^2 .
It is an emirp because it is prime and its reverse (1413153551) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1553513141 - 218 = 1553250997 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1553513147) 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, 776756570 + 776756571.
It is an arithmetic number, because the mean of its divisors is an integer number (776756571).
Almost surely, 21553513141 is an apocalyptic number.
It is an amenable number.
1553513141 is a deficient number, since it is larger than the sum of its proper divisors (1).
1553513141 is an equidigital number, since it uses as much as digits as its factorization.
1553513141 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 4500, while the sum is 29.
The square root of 1553513141 is about 39414.6310524404. The cubic root of 1553513141 is about 1158.1682199493.
Adding to 1553513141 its reverse (1413153551), we get a palindrome (2966666692).
The spelling of 1553513141 in words is "one billion, five hundred fifty-three million, five hundred thirteen thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •