Base | Representation |
---|---|
bin | 1001101001101000… |
… | …01011111011100001 |
3 | 111101002002021010211 |
4 | 10310310023323201 |
5 | 41102323003011 |
6 | 2214040054121 |
7 | 242251210411 |
oct | 46464137341 |
9 | 14332067124 |
10 | 5181062881 |
11 | 2219636255 |
12 | 1007164341 |
13 | 6475154a7 |
14 | 372154641 |
15 | 204cbeb21 |
hex | 134d0bee1 |
5181062881 has 2 divisors, whose sum is σ = 5181062882. Its totient is φ = 5181062880.
The previous prime is 5181062879. The next prime is 5181062893. The reversal of 5181062881 is 1882601815.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 4735641856 + 445421025 = 68816^2 + 21105^2 .
It is a cyclic number.
It is not a de Polignac number, because 5181062881 - 21 = 5181062879 is a prime.
It is a super-2 number, since 2×51810628812 = 53686825153752040322, which contains 22 as substring.
Together with 5181062879, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (5181062801) 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, 2590531440 + 2590531441.
It is an arithmetic number, because the mean of its divisors is an integer number (2590531441).
Almost surely, 25181062881 is an apocalyptic number.
It is an amenable number.
5181062881 is a deficient number, since it is larger than the sum of its proper divisors (1).
5181062881 is an equidigital number, since it uses as much as digits as its factorization.
5181062881 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 30720, while the sum is 40.
The square root of 5181062881 is about 71979.6004504054. The cubic root of 5181062881 is about 1730.3725662454.
The spelling of 5181062881 in words is "five billion, one hundred eighty-one million, sixty-two thousand, eight hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •