Base | Representation |
---|---|
bin | 101110010010001… |
… | …1010101010000001 |
3 | 11000020100010102022 |
4 | 1130210122222001 |
5 | 11140040101431 |
6 | 414035131225 |
7 | 53325465161 |
oct | 13444325201 |
9 | 4006303368 |
10 | 1553050241 |
11 | 7277246a6 |
12 | 374143b15 |
13 | 1b99a7b52 |
14 | 10a3925a1 |
15 | 9152807b |
hex | 5c91aa81 |
1553050241 has 2 divisors, whose sum is σ = 1553050242. Its totient is φ = 1553050240.
The previous prime is 1553050231. The next prime is 1553050271. The reversal of 1553050241 is 1420503551.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1511576641 + 41473600 = 38879^2 + 6440^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1553050241 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1553050241.
It is not a weakly prime, because it can be changed into another prime (1553050211) 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, 776525120 + 776525121.
It is an arithmetic number, because the mean of its divisors is an integer number (776525121).
Almost surely, 21553050241 is an apocalyptic number.
It is an amenable number.
1553050241 is a deficient number, since it is larger than the sum of its proper divisors (1).
1553050241 is an equidigital number, since it uses as much as digits as its factorization.
1553050241 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3000, while the sum is 26.
The square root of 1553050241 is about 39408.7584300749. The cubic root of 1553050241 is about 1158.0531754709.
Adding to 1553050241 its reverse (1420503551), we get a palindrome (2973553792).
The spelling of 1553050241 in words is "one billion, five hundred fifty-three million, fifty thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •