Base | Representation |
---|---|
bin | 1001011010001010… |
… | …01110101011110001 |
3 | 111001000221021121021 |
4 | 10231011032223301 |
5 | 40321114003011 |
6 | 2153123055441 |
7 | 236114310466 |
oct | 45505165361 |
9 | 14030837537 |
10 | 5051312881 |
11 | 216237514a |
12 | b8b811581 |
13 | 626686744 |
14 | 35cc1b66d |
15 | 1e86e0471 |
hex | 12d14eaf1 |
5051312881 has 2 divisors, whose sum is σ = 5051312882. Its totient is φ = 5051312880.
The previous prime is 5051312879. The next prime is 5051312911. The reversal of 5051312881 is 1882131505.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 5004855025 + 46457856 = 70745^2 + 6816^2 .
It is a cyclic number.
It is not a de Polignac number, because 5051312881 - 21 = 5051312879 is a prime.
It is a super-2 number, since 2×50513128812 = 51031523643513040322, which contains 22 as substring.
Together with 5051312879, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (5051312801) 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, 2525656440 + 2525656441.
It is an arithmetic number, because the mean of its divisors is an integer number (2525656441).
Almost surely, 25051312881 is an apocalyptic number.
It is an amenable number.
5051312881 is a deficient number, since it is larger than the sum of its proper divisors (1).
5051312881 is an equidigital number, since it uses as much as digits as its factorization.
5051312881 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9600, while the sum is 34.
The square root of 5051312881 is about 71072.5888159423. The cubic root of 5051312881 is about 1715.8056355342.
The spelling of 5051312881 in words is "five billion, fifty-one million, three hundred twelve thousand, eight hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •