Base | Representation |
---|---|
bin | 1001111010010100… |
… | …11101101000011111 |
3 | 111201211121220210011 |
4 | 10331022131220133 |
5 | 41344201322122 |
6 | 2240002024051 |
7 | 245601530140 |
oct | 47512355037 |
9 | 14654556704 |
10 | 5321120287 |
11 | 22906a747a |
12 | 1046048027 |
13 | 66a5429b2 |
14 | 3869b1ac7 |
15 | 212238377 |
hex | 13d29da1f |
5321120287 has 18 divisors (see below), whose sum is σ = 6176931768. Its totient is φ = 4490323344.
The previous prime is 5321120281. The next prime is 5321120293. The reversal of 5321120287 is 7820211235.
It is an interprime number because it is at equal distance from previous prime (5321120281) and next prime (5321120293).
It is not a de Polignac number, because 5321120287 - 231 = 3173636639 is a prime.
It is a super-2 number, since 2×53211202872 = 56628642217445924738, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5321120281) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 17 ways as a sum of consecutive naturals, for example, 15246589 + ... + 15246937.
It is an arithmetic number, because the mean of its divisors is an integer number (343162876).
Almost surely, 25321120287 is an apocalyptic number.
5321120287 is a deficient number, since it is larger than the sum of its proper divisors (855811481).
5321120287 is an frugal number, since it uses more digits than its factorization.
5321120287 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 863 (or 435 counting only the distinct ones).
The product of its (nonzero) digits is 6720, while the sum is 31.
The square root of 5321120287 is about 72946.0093973618. The cubic root of 5321120287 is about 1745.8262753551.
The spelling of 5321120287 in words is "five billion, three hundred twenty-one million, one hundred twenty thousand, two hundred eighty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •