Base | Representation |
---|---|
bin | 10101100110010101001111 |
3 | 101122122211212 |
4 | 111212111033 |
5 | 2422141111 |
6 | 321205035 |
7 | 66061244 |
oct | 25462517 |
9 | 11578755 |
10 | 5662031 |
11 | 3217a71 |
12 | 1a9077b |
13 | 123321b |
14 | a755cb |
15 | 76c98b |
hex | 56654f |
5662031 has 4 divisors (see below), whose sum is σ = 5666832. Its totient is φ = 5657232.
The previous prime is 5661991. The next prime is 5662039. The reversal of 5662031 is 1302665.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5662031 is a prime.
It is a super-2 number, since 2×56620312 = 64117190089922, 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 = 5661988 and 5662006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5662039) 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, 731 + ... + 3443.
It is an arithmetic number, because the mean of its divisors is an integer number (1416708).
Almost surely, 25662031 is an apocalyptic number.
5662031 is a deficient number, since it is larger than the sum of its proper divisors (4801).
5662031 is a wasteful number, since it uses less digits than its factorization.
5662031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4800.
The product of its (nonzero) digits is 1080, while the sum is 23.
The square root of 5662031 is about 2379.5022588768. The cubic root of 5662031 is about 178.2340795311.
Adding to 5662031 its reverse (1302665), we get a palindrome (6964696).
The spelling of 5662031 in words is "five million, six hundred sixty-two thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •