Base | Representation |
---|---|
bin | 1001100011111011… |
… | …01100110101000001 |
3 | 111020202001212021212 |
4 | 10301331230311001 |
5 | 41003101202111 |
6 | 2205210455505 |
7 | 241130460242 |
oct | 46175546501 |
9 | 14222055255 |
10 | 5133225281 |
11 | 21a4632148 |
12 | bb3134595 |
13 | 63a636412 |
14 | 369a60cc9 |
15 | 2009c098b |
hex | 131f6cd41 |
5133225281 has 2 divisors, whose sum is σ = 5133225282. Its totient is φ = 5133225280.
The previous prime is 5133225247. The next prime is 5133225287. The reversal of 5133225281 is 1825223315.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2602632256 + 2530593025 = 51016^2 + 50305^2 .
It is a cyclic number.
It is not a de Polignac number, because 5133225281 - 26 = 5133225217 is a prime.
It is a super-2 number, since 2×51332252812 = 52700003570995057922, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (5133225287) 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, 2566612640 + 2566612641.
It is an arithmetic number, because the mean of its divisors is an integer number (2566612641).
Almost surely, 25133225281 is an apocalyptic number.
It is an amenable number.
5133225281 is a deficient number, since it is larger than the sum of its proper divisors (1).
5133225281 is an equidigital number, since it uses as much as digits as its factorization.
5133225281 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 14400, while the sum is 32.
The square root of 5133225281 is about 71646.5301392887. The cubic root of 5133225281 is about 1725.0304867258.
Adding to 5133225281 its reverse (1825223315), we get a palindrome (6958448596).
The spelling of 5133225281 in words is "five billion, one hundred thirty-three million, two hundred twenty-five thousand, two hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •