Base | Representation |
---|---|
bin | 10101011010001001100011 |
3 | 101120010101201 |
4 | 111122021203 |
5 | 2414042011 |
6 | 320142031 |
7 | 65462620 |
oct | 25321143 |
9 | 11503351 |
10 | 5612131 |
11 | 3193528 |
12 | 1a67917 |
13 | 12165b5 |
14 | a61347 |
15 | 75ccc1 |
hex | 55a263 |
5612131 has 4 divisors (see below), whose sum is σ = 6413872. Its totient is φ = 4810392.
The previous prime is 5612111. The next prime is 5612137. The reversal of 5612131 is 1312165.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 1312165 = 5 ⋅262433.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5612131 is a prime.
It is a super-2 number, since 2×56121312 = 62992028722322, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5612099 and 5612108.
It is not an unprimeable number, because it can be changed into a prime (5612137) 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 in 3 ways as a sum of consecutive naturals, for example, 400860 + ... + 400873.
It is an arithmetic number, because the mean of its divisors is an integer number (1603468).
Almost surely, 25612131 is an apocalyptic number.
5612131 is a deficient number, since it is larger than the sum of its proper divisors (801741).
5612131 is an equidigital number, since it uses as much as digits as its factorization.
5612131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 801740.
The product of its digits is 180, while the sum is 19.
The square root of 5612131 is about 2368.9936682060. The cubic root of 5612131 is about 177.7089360046.
Adding to 5612131 its reverse (1312165), we get a palindrome (6924296).
The spelling of 5612131 in words is "five million, six hundred twelve thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •