Base | Representation |
---|---|
bin | 101010101110… |
… | …011010000011 |
3 | 210002000200200 |
4 | 222232122003 |
5 | 10331401011 |
6 | 1040020243 |
7 | 164125305 |
oct | 52563203 |
9 | 23060620 |
10 | 11200131 |
11 | 635a908 |
12 | 3901683 |
13 | 2421bc7 |
14 | 16b7975 |
15 | eb3856 |
hex | aae683 |
11200131 has 6 divisors (see below), whose sum is σ = 16177980. Its totient is φ = 7466748.
The previous prime is 11200129. The next prime is 11200151. The reversal of 11200131 is 13100211.
11200131 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 11200131 - 21 = 11200129 is a prime.
It is a super-2 number, since 2×112001312 = 250885868834322, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (9), and also a Moran number because the ratio is a prime number: 1244459 = 11200131 / (1 + 1 + 2 + 0 + 0 + 1 + 3 + 1).
It is not an unprimeable number, because it can be changed into a prime (11200151) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 622221 + ... + 622238.
It is an arithmetic number, because the mean of its divisors is an integer number (2696330).
Almost surely, 211200131 is an apocalyptic number.
11200131 is a deficient number, since it is larger than the sum of its proper divisors (4977849).
11200131 is a wasteful number, since it uses less digits than its factorization.
11200131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1244465 (or 1244462 counting only the distinct ones).
The product of its (nonzero) digits is 6, while the sum is 9.
The square root of 11200131 is about 3346.6596779476. The cubic root of 11200131 is about 223.7386607239.
Adding to 11200131 its reverse (13100211), we get a palindrome (24300342).
The spelling of 11200131 in words is "eleven million, two hundred thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •