Base | Representation |
---|---|
bin | 101011001000… |
… | …000010110101 |
3 | 210021100201221 |
4 | 223020002311 |
5 | 10343231031 |
6 | 1042150341 |
7 | 165043411 |
oct | 53100265 |
9 | 23240657 |
10 | 11305141 |
11 | 64217a1 |
12 | 39523b1 |
13 | 245a943 |
14 | 1703d41 |
15 | ed4a11 |
hex | ac80b5 |
11305141 has 2 divisors, whose sum is σ = 11305142. Its totient is φ = 11305140.
The previous prime is 11305139. The next prime is 11305183. The reversal of 11305141 is 14150311.
11305141 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 8242641 + 3062500 = 2871^2 + 1750^2 .
It is a cyclic number.
It is not a de Polignac number, because 11305141 - 21 = 11305139 is a prime.
Together with 11305139, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11305841) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5652570 + 5652571.
It is an arithmetic number, because the mean of its divisors is an integer number (5652571).
Almost surely, 211305141 is an apocalyptic number.
It is an amenable number.
11305141 is a deficient number, since it is larger than the sum of its proper divisors (1).
11305141 is an equidigital number, since it uses as much as digits as its factorization.
11305141 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 60, while the sum is 16.
The square root of 11305141 is about 3362.3118534723. The cubic root of 11305141 is about 224.4357284481.
Adding to 11305141 its reverse (14150311), we get a palindrome (25455452).
It can be divided in two parts, 11305 and 141, that multiplied together give a triangular number (1594005 = T1785).
The spelling of 11305141 in words is "eleven million, three hundred five thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •