Base | Representation |
---|---|
bin | 10101011001000100110011 |
3 | 101112220100202 |
4 | 111121010303 |
5 | 2413421411 |
6 | 320105415 |
7 | 65444033 |
oct | 25310463 |
9 | 11486322 |
10 | 5607731 |
11 | 3190198 |
12 | 1a6526b |
13 | 12145ac |
14 | a5d8c3 |
15 | 75b83b |
hex | 559133 |
5607731 has 2 divisors, whose sum is σ = 5607732. Its totient is φ = 5607730.
The previous prime is 5607713. The next prime is 5607733. The reversal of 5607731 is 1377065.
5607731 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
Together with previous prime (5607713) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 5607731 - 210 = 5606707 is a prime.
It is a super-2 number, since 2×56077312 = 62893293936722, which contains 22 as substring.
Together with 5607733, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 5607694 and 5607703.
It is not a weakly prime, because it can be changed into another prime (5607733) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2803865 + 2803866.
It is an arithmetic number, because the mean of its divisors is an integer number (2803866).
Almost surely, 25607731 is an apocalyptic number.
5607731 is a deficient number, since it is larger than the sum of its proper divisors (1).
5607731 is an equidigital number, since it uses as much as digits as its factorization.
5607731 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4410, while the sum is 29.
The square root of 5607731 is about 2368.0648217479. The cubic root of 5607731 is about 177.6624816511.
The spelling of 5607731 in words is "five million, six hundred seven thousand, seven hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •