Base | Representation |
---|---|
bin | 1001100011011011… |
… | …00000111100001001 |
3 | 111020110002021222201 |
4 | 10301231200330021 |
5 | 41001004413111 |
6 | 2204535520201 |
7 | 241046426053 |
oct | 46155407411 |
9 | 14213067881 |
10 | 5128982281 |
11 | 21a21a4335 |
12 | bb1829061 |
13 | 6397ac077 |
14 | 3692788d3 |
15 | 2004336c1 |
hex | 131b60f09 |
5128982281 has 2 divisors, whose sum is σ = 5128982282. Its totient is φ = 5128982280.
The previous prime is 5128982273. The next prime is 5128982317. The reversal of 5128982281 is 1822898215.
5128982281 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2931247881 + 2197734400 = 54141^2 + 46880^2 .
It is a cyclic number.
It is not a de Polignac number, because 5128982281 - 23 = 5128982273 is a prime.
It is a super-2 number, since 2×51289822812 = 52612918477623925922, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (5128982231) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2564491140 + 2564491141.
It is an arithmetic number, because the mean of its divisors is an integer number (2564491141).
Almost surely, 25128982281 is an apocalyptic number.
It is an amenable number.
5128982281 is a deficient number, since it is larger than the sum of its proper divisors (1).
5128982281 is an equidigital number, since it uses as much as digits as its factorization.
5128982281 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 184320, while the sum is 46.
The square root of 5128982281 is about 71616.9133724709. The cubic root of 5128982281 is about 1724.5550662033. Note that the first 3 decimals are identical.
The spelling of 5128982281 in words is "five billion, one hundred twenty-eight million, nine hundred eighty-two thousand, two hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •