Base | Representation |
---|---|
bin | 101011011110… |
… | …000001000101 |
3 | 210102221012021 |
4 | 223132001011 |
5 | 10404121031 |
6 | 1044123141 |
7 | 165566662 |
oct | 53360105 |
9 | 23387167 |
10 | 11395141 |
11 | 648337a |
12 | 39964b1 |
13 | 248c8b4 |
14 | 1728a69 |
15 | 1001511 |
hex | ade045 |
11395141 has 4 divisors (see below), whose sum is σ = 11401900. Its totient is φ = 11388384.
The previous prime is 11395127. The next prime is 11395147. The reversal of 11395141 is 14159311.
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, and also an emirpimes, since its reverse is a distinct semiprime: 14159311 = 67 ⋅211333.
It can be written as a sum of positive squares in 2 ways, for example, as 2117025 + 9278116 = 1455^2 + 3046^2 .
It is a cyclic number.
It is not a de Polignac number, because 11395141 - 211 = 11393093 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11395147) 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, 1465 + ... + 4993.
It is an arithmetic number, because the mean of its divisors is an integer number (2850475).
Almost surely, 211395141 is an apocalyptic number.
It is an amenable number.
11395141 is a deficient number, since it is larger than the sum of its proper divisors (6759).
11395141 is an equidigital number, since it uses as much as digits as its factorization.
11395141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6758.
The product of its digits is 540, while the sum is 25.
The square root of 11395141 is about 3375.6689707375. The cubic root of 11395141 is about 225.0297310506.
The spelling of 11395141 in words is "eleven million, three hundred ninety-five thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •