Base | Representation |
---|---|
bin | 1011101010000111110101 |
3 | 12202021012112 |
4 | 23222013311 |
5 | 1240243432 |
6 | 145300405 |
7 | 34655651 |
oct | 13520765 |
9 | 5667175 |
10 | 3056117 |
11 | 17a8119 |
12 | 1034705 |
13 | 83006c |
14 | 597a61 |
15 | 4057b2 |
hex | 2ea1f5 |
3056117 has 4 divisors (see below), whose sum is σ = 3067200. Its totient is φ = 3045036.
The previous prime is 3056111. The next prime is 3056129. The reversal of 3056117 is 7116503.
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 3056117 - 210 = 3055093 is a prime.
It is a super-3 number, since 3×30561173 = 85631033334715060839, which contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 3056092 and 3056101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3056111) 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, 5117 + ... + 5682.
It is an arithmetic number, because the mean of its divisors is an integer number (766800).
Almost surely, 23056117 is an apocalyptic number.
It is an amenable number.
3056117 is a deficient number, since it is larger than the sum of its proper divisors (11083).
3056117 is a wasteful number, since it uses less digits than its factorization.
3056117 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11082.
The product of its (nonzero) digits is 630, while the sum is 23.
The square root of 3056117 is about 1748.1753344559. The cubic root of 3056117 is about 145.1186820637.
The spelling of 3056117 in words is "three million, fifty-six thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •