Base | Representation |
---|---|
bin | 1010001001110110… |
… | …00111110000111001 |
3 | 112001220121120010000 |
4 | 11010323013300321 |
5 | 42131014110111 |
6 | 2300532343213 |
7 | 252042265245 |
oct | 50473076071 |
9 | 15056546100 |
10 | 5451316281 |
11 | 2348142674 |
12 | 1081774b09 |
13 | 68b4c9748 |
14 | 399dc3425 |
15 | 21d8a4c56 |
hex | 144ec7c39 |
5451316281 has 20 divisors (see below), whose sum is σ = 8215402932. Its totient is φ = 3602043648.
The previous prime is 5451316261. The next prime is 5451316307. The reversal of 5451316281 is 1826131545.
5451316281 is a `hidden beast` number, since 5 + 4 + 513 + 1 + 62 + 81 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 2317555881 + 3133760400 = 48141^2 + 55980^2 .
It is not a de Polignac number, because 5451316281 - 26 = 5451316217 is a prime.
It is a super-2 number, since 2×54513162812 = 59433698390991341922, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (5451316261) 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 in 19 ways as a sum of consecutive naturals, for example, 288636 + ... + 306941.
Almost surely, 25451316281 is an apocalyptic number.
It is an amenable number.
5451316281 is a deficient number, since it is larger than the sum of its proper divisors (2764086651).
5451316281 is a wasteful number, since it uses less digits than its factorization.
5451316281 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 595702 (or 595693 counting only the distinct ones).
The product of its digits is 28800, while the sum is 36.
The square root of 5451316281 is about 73833.0297427919. The cubic root of 5451316281 is about 1759.9505281592.
The spelling of 5451316281 in words is "five billion, four hundred fifty-one million, three hundred sixteen thousand, two hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •