Base | Representation |
---|---|
bin | 1010010011100111… |
… | …11011000010101001 |
3 | 112021121220112112112 |
4 | 11021303323002221 |
5 | 42313012041431 |
6 | 2313022052105 |
7 | 254056255256 |
oct | 51163730251 |
9 | 15247815475 |
10 | 5533315241 |
11 | 238a459703 |
12 | 10a511a035 |
13 | 6a24a993c |
14 | 3a6c4a42d |
15 | 225ba0c2b |
hex | 149cfb0a9 |
5533315241 has 2 divisors, whose sum is σ = 5533315242. Its totient is φ = 5533315240.
The previous prime is 5533315237. The next prime is 5533315297. The reversal of 5533315241 is 1425133355.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 4559625625 + 973689616 = 67525^2 + 31204^2 .
It is a cyclic number.
It is not a de Polignac number, because 5533315241 - 22 = 5533315237 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 5533315198 and 5533315207.
It is not a weakly prime, because it can be changed into another prime (5533312241) 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, 2766657620 + 2766657621.
It is an arithmetic number, because the mean of its divisors is an integer number (2766657621).
Almost surely, 25533315241 is an apocalyptic number.
It is an amenable number.
5533315241 is a deficient number, since it is larger than the sum of its proper divisors (1).
5533315241 is an equidigital number, since it uses as much as digits as its factorization.
5533315241 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 27000, while the sum is 32.
The square root of 5533315241 is about 74386.2570707789. The cubic root of 5533315241 is about 1768.7310684402.
Adding to 5533315241 its reverse (1425133355), we get a palindrome (6958448596).
The spelling of 5533315241 in words is "five billion, five hundred thirty-three million, three hundred fifteen thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •