Base | Representation |
---|---|
bin | 101010000010… |
… | …011101101101 |
3 | 202201212210101 |
4 | 222002131231 |
5 | 10310121031 |
6 | 1032111101 |
7 | 162445456 |
oct | 52023555 |
9 | 22655711 |
10 | 11020141 |
11 | 6247660 |
12 | 3835491 |
13 | 238acc2 |
14 | 166c12d |
15 | e7a361 |
hex | a8276d |
11020141 has 4 divisors (see below), whose sum is σ = 12021984. Its totient is φ = 10018300.
The previous prime is 11020129. The next prime is 11020181. The reversal of 11020141 is 14102011.
11020141 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 11020141 - 25 = 11020109 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 (11020181) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 500905 + ... + 500926.
It is an arithmetic number, because the mean of its divisors is an integer number (3005496).
Almost surely, 211020141 is an apocalyptic number.
11020141 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
11020141 is a deficient number, since it is larger than the sum of its proper divisors (1001843).
11020141 is a wasteful number, since it uses less digits than its factorization.
11020141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1001842.
The product of its (nonzero) digits is 8, while the sum is 10.
The square root of 11020141 is about 3319.6597717236. The cubic root of 11020141 is about 222.5336632145.
Adding to 11020141 its reverse (14102011), we get a palindrome (25122152).
The spelling of 11020141 in words is "eleven million, twenty thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •