Base | Representation |
---|---|
bin | 11001100010100011100101 |
3 | 110121011000012 |
4 | 121202203211 |
5 | 3203221031 |
6 | 355300005 |
7 | 110623235 |
oct | 31424345 |
9 | 13534005 |
10 | 6695141 |
11 | 3863182 |
12 | 22aa605 |
13 | 150552b |
14 | c63cc5 |
15 | 8c3b2b |
hex | 6628e5 |
6695141 has 4 divisors (see below), whose sum is σ = 6720300. Its totient is φ = 6669984.
The previous prime is 6695131. The next prime is 6695149. The reversal of 6695141 is 1415966.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 1415966 = 2 ⋅707983.
It can be written as a sum of positive squares in 2 ways, for example, as 172225 + 6522916 = 415^2 + 2554^2 .
It is a cyclic number.
It is not a de Polignac number, because 6695141 - 210 = 6694117 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 6695098 and 6695107.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (6695149) 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, 12176 + ... + 12713.
It is an arithmetic number, because the mean of its divisors is an integer number (1680075).
Almost surely, 26695141 is an apocalyptic number.
It is an amenable number.
6695141 is a deficient number, since it is larger than the sum of its proper divisors (25159).
6695141 is a wasteful number, since it uses less digits than its factorization.
6695141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25158.
The product of its digits is 6480, while the sum is 32.
The square root of 6695141 is about 2587.4970531384. The cubic root of 6695141 is about 188.4747789243.
The spelling of 6695141 in words is "six million, six hundred ninety-five thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •