Base | Representation |
---|---|
bin | 1011011111001000101101 |
3 | 12122222110212 |
4 | 23133020231 |
5 | 1232323432 |
6 | 144312205 |
7 | 34410524 |
oct | 13371055 |
9 | 5588425 |
10 | 3011117 |
11 | 177732a |
12 | 1012665 |
13 | 815735 |
14 | 5854bb |
15 | 3e72b2 |
hex | 2df22d |
3011117 has 2 divisors, whose sum is σ = 3011118. Its totient is φ = 3011116.
The previous prime is 3011093. The next prime is 3011119. The reversal of 3011117 is 7111103.
3011117 is an esthetic number in base 5, because in such base its adjacent digits differ by 1.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2979076 + 32041 = 1726^2 + 179^2 .
It is an emirp because it is prime and its reverse (7111103) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 3011117 - 26 = 3011053 is a prime.
Together with 3011119, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3011119) 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 as a sum of consecutive naturals, namely, 1505558 + 1505559.
It is an arithmetic number, because the mean of its divisors is an integer number (1505559).
Almost surely, 23011117 is an apocalyptic number.
It is an amenable number.
3011117 is a deficient number, since it is larger than the sum of its proper divisors (1).
3011117 is an equidigital number, since it uses as much as digits as its factorization.
3011117 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 21, while the sum is 14.
The square root of 3011117 is about 1735.2570414783. The cubic root of 3011117 is about 144.4028872999.
Subtracting from 3011117 its sum of digits (14), we obtain a palindrome (3011103).
The spelling of 3011117 in words is "three million, eleven thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •