Base | Representation |
---|---|
bin | 10011011001101100011101 |
3 | 100120101122200 |
4 | 103121230131 |
5 | 2300222411 |
6 | 301002113 |
7 | 61141635 |
oct | 23315435 |
9 | 10511580 |
10 | 5085981 |
11 | 296419a |
12 | 1853339 |
13 | 1090c74 |
14 | 9656c5 |
15 | 6a6e56 |
hex | 4d9b1d |
5085981 has 6 divisors (see below), whose sum is σ = 7346430. Its totient is φ = 3390648.
The previous prime is 5085973. The next prime is 5085989. The reversal of 5085981 is 1895805.
It is an interprime number because it is at equal distance from previous prime (5085973) and next prime (5085989).
It can be written as a sum of positive squares in only one way, i.e., 4536900 + 549081 = 2130^2 + 741^2 .
It is not a de Polignac number, because 5085981 - 23 = 5085973 is a prime.
It is a super-2 number, since 2×50859812 = 51734405464722, which contains 22 as substring.
It is an Ulam number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5085989) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 282546 + ... + 282563.
It is an arithmetic number, because the mean of its divisors is an integer number (1224405).
Almost surely, 25085981 is an apocalyptic number.
It is an amenable number.
5085981 is a deficient number, since it is larger than the sum of its proper divisors (2260449).
5085981 is a wasteful number, since it uses less digits than its factorization.
5085981 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 565115 (or 565112 counting only the distinct ones).
The product of its (nonzero) digits is 14400, while the sum is 36.
The square root of 5085981 is about 2255.2119634305. The cubic root of 5085981 is about 171.9721989499.
The spelling of 5085981 in words is "five million, eighty-five thousand, nine hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •