Base | Representation |
---|---|
bin | 1010000111010101101111… |
… | …0001110000110100001001 |
3 | 1110101011210020211210022110 |
4 | 2201311123301300310021 |
5 | 2424202214241213001 |
6 | 35353002520412533 |
7 | 2225323645064100 |
oct | 241653361606411 |
9 | 43334706753273 |
10 | 11121210101001 |
11 | 35a852a199900 |
12 | 12b7446917149 |
13 | 62895822b400 |
14 | 2a63ab4bb037 |
15 | 14444c9e33d6 |
hex | a1d5bc70d09 |
11121210101001 has 216 divisors, whose sum is σ = 21085622615232. Its totient is φ = 5188665081600.
The previous prime is 11121210100991. The next prime is 11121210101009. The reversal of 11121210101001 is 10010101212111.
It is not a de Polignac number, because 11121210101001 - 213 = 11121210092809 is a prime.
It is a super-2 number, since 2×111212101010012 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (11121210101009) by changing a digit.
It is a polite number, since it can be written in 215 ways as a sum of consecutive naturals, for example, 111172116 + ... + 111272106.
Almost surely, 211121210101001 is an apocalyptic number.
11121210101001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
11121210101001 is a deficient number, since it is larger than the sum of its proper divisors (9964412514231).
11121210101001 is a wasteful number, since it uses less digits than its factorization.
11121210101001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 100093 (or 100062 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 12.
Adding to 11121210101001 its reverse (10010101212111), we get a palindrome (21131311313112).
It can be divided in two parts, 11121210 and 101001, that added together give a palindrome (11222211).
The spelling of 11121210101001 in words is "eleven trillion, one hundred twenty-one billion, two hundred ten million, one hundred one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •