Base | Representation |
---|---|
bin | 1010000111011001011101… |
… | …1100010011110001110001 |
3 | 1110101021101000102022111212 |
4 | 2201312113130103301301 |
5 | 2424211242021010001 |
6 | 35353250115445505 |
7 | 2225360521366505 |
oct | 241662734236161 |
9 | 43337330368455 |
10 | 11122211110001 |
11 | 35a89a3241772 |
12 | 12b7685bb6895 |
13 | 628a8772c924 |
14 | 2a646440c305 |
15 | 1444aa8237bb |
hex | a1d97713c71 |
11122211110001 has 32 divisors (see below), whose sum is σ = 12343031424000. Its totient is φ = 9968405708800.
The previous prime is 11122211109887. The next prime is 11122211110013. The reversal of 11122211110001 is 10001111222111.
It is not a de Polignac number, because 11122211110001 - 210 = 11122211108977 is a prime.
It is not an unprimeable number, because it can be changed into a prime (11122211110601) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 434431601 + ... + 434457201.
It is an arithmetic number, because the mean of its divisors is an integer number (385719732000).
Almost surely, 211122211110001 is an apocalyptic number.
It is an amenable number.
11122211110001 is a deficient number, since it is larger than the sum of its proper divisors (1220820313999).
11122211110001 is a wasteful number, since it uses less digits than its factorization.
11122211110001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30529.
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 11122211110001 its reverse (10001111222111), we get a palindrome (21123322332112).
It can be divided in two parts, 111222111 and 10001, that multiplied together give a palindrome (1112332332111).
The spelling of 11122211110001 in words is "eleven trillion, one hundred twenty-two billion, two hundred eleven million, one hundred ten thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •