Base | Representation |
---|---|
bin | 101000111100010101111… |
… | …1010110011011000110001 |
3 | 201220221122100011220001002 |
4 | 1101320223322303120301 |
5 | 1214143342330233011 |
6 | 15545024012451345 |
7 | 1120355605513505 |
oct | 121705372633061 |
9 | 21827570156032 |
10 | 5627143992881 |
11 | 187a5050a2724 |
12 | 76a6b3179b55 |
13 | 31a8394a9c08 |
14 | 1564d8a32305 |
15 | 9b5955b8c3b |
hex | 51e2beb3631 |
5627143992881 has 2 divisors, whose sum is σ = 5627143992882. Its totient is φ = 5627143992880.
The previous prime is 5627143992829. The next prime is 5627143992929. The reversal of 5627143992881 is 1882993417265.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3272119210000 + 2355024782881 = 1808900^2 + 1534609^2 .
It is a cyclic number.
It is not a de Polignac number, because 5627143992881 - 218 = 5627143730737 is a prime.
It is a super-2 number, since 2×56271439928812 (a number of 26 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (5627143992781) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2813571996440 + 2813571996441.
It is an arithmetic number, because the mean of its divisors is an integer number (2813571996441).
Almost surely, 25627143992881 is an apocalyptic number.
It is an amenable number.
5627143992881 is a deficient number, since it is larger than the sum of its proper divisors (1).
5627143992881 is an equidigital number, since it uses as much as digits as its factorization.
5627143992881 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 52254720, while the sum is 65.
The spelling of 5627143992881 in words is "five trillion, six hundred twenty-seven billion, one hundred forty-three million, nine hundred ninety-two thousand, eight hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •