Base | Representation |
---|---|
bin | 1100010100011110… |
… | …00001001010101001 |
3 | 122001221201010212102 |
4 | 12022033001022221 |
5 | 102021211110131 |
6 | 3012152223145 |
7 | 322622301266 |
oct | 61217011251 |
9 | 18057633772 |
10 | 6614160041 |
11 | 2894580375 |
12 | 134709aab5 |
13 | 8153b1888 |
14 | 46a60026d |
15 | 28aa011cb |
hex | 18a3c12a9 |
6614160041 has 2 divisors, whose sum is σ = 6614160042. Its totient is φ = 6614160040.
The previous prime is 6614159999. The next prime is 6614160043. The reversal of 6614160041 is 1400614166.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5339955625 + 1274204416 = 73075^2 + 35696^2 .
It is a cyclic number.
It is not a de Polignac number, because 6614160041 - 230 = 5540418217 is a prime.
It is a super-2 number, since 2×66141600412 = 87494226095922243362, which contains 22 as substring.
Together with 6614160043, 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 = 6614159986 and 6614160013.
It is not a weakly prime, because it can be changed into another prime (6614160043) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 3307080020 + 3307080021.
It is an arithmetic number, because the mean of its divisors is an integer number (3307080021).
Almost surely, 26614160041 is an apocalyptic number.
It is an amenable number.
6614160041 is a deficient number, since it is larger than the sum of its proper divisors (1).
6614160041 is an equidigital number, since it uses as much as digits as its factorization.
6614160041 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3456, while the sum is 29.
The square root of 6614160041 is about 81327.4863806819. The cubic root of 6614160041 is about 1877.1179661259.
The spelling of 6614160041 in words is "six billion, six hundred fourteen million, one hundred sixty thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •