Base | Representation |
---|---|
bin | 10101101111000111000101 |
3 | 101201111011122 |
4 | 111233013011 |
5 | 2424313424 |
6 | 322043325 |
7 | 66301133 |
oct | 25570705 |
9 | 11644148 |
10 | 5697989 |
11 | 3241a90 |
12 | 1aa9545 |
13 | 12466bb |
14 | a84753 |
15 | 77845e |
hex | 56f1c5 |
5697989 has 4 divisors (see below), whose sum is σ = 6216000. Its totient is φ = 5179980.
The previous prime is 5697983. The next prime is 5698003. The reversal of 5697989 is 9897965.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 5697989 - 216 = 5632453 is a prime.
It is a Duffinian number.
It is a plaindrome in base 13.
It is a self number, because there is not a number n which added to its sum of digits gives 5697989.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5697983) 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 3 ways as a sum of consecutive naturals, for example, 258989 + ... + 259010.
It is an arithmetic number, because the mean of its divisors is an integer number (1554000).
Almost surely, 25697989 is an apocalyptic number.
It is an amenable number.
5697989 is a deficient number, since it is larger than the sum of its proper divisors (518011).
5697989 is a wasteful number, since it uses less digits than its factorization.
5697989 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 518010.
The product of its digits is 1224720, while the sum is 53.
The square root of 5697989 is about 2387.0460825045. The cubic root of 5697989 is about 178.6105888059.
It can be divided in two parts, 569 and 7989, that added together give a palindrome (8558).
The spelling of 5697989 in words is "five million, six hundred ninety-seven thousand, nine hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •