Base | Representation |
---|---|
bin | 10100101111000101… |
… | …01111001100010001 |
3 | 1001201211120112102222 |
4 | 22113202233030101 |
5 | 140244343303101 |
6 | 5040353550425 |
7 | 542604561563 |
oct | 122742571421 |
9 | 31654515388 |
10 | 11132400401 |
11 | 47a2a4a211 |
12 | 21a8275415 |
13 | 10854a3895 |
14 | 7786d7333 |
15 | 4524e401b |
hex | 2978af311 |
11132400401 has 16 divisors (see below), whose sum is σ = 11665866240. Its totient is φ = 10612177920.
The previous prime is 11132400347. The next prime is 11132400403. The reversal of 11132400401 is 10400423111.
It is a happy number.
11132400401 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 11132400401 - 26 = 11132400337 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11132400401.
It is not an unprimeable number, because it can be changed into a prime (11132400403) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1242305 + ... + 1251233.
It is an arithmetic number, because the mean of its divisors is an integer number (729116640).
Almost surely, 211132400401 is an apocalyptic number.
It is an amenable number.
11132400401 is a deficient number, since it is larger than the sum of its proper divisors (533465839).
11132400401 is an equidigital number, since it uses as much as digits as its factorization.
11132400401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9664.
The product of its (nonzero) digits is 96, while the sum is 17.
Adding to 11132400401 its reverse (10400423111), we get a palindrome (21532823512).
The spelling of 11132400401 in words is "eleven billion, one hundred thirty-two million, four hundred thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •