Base | Representation |
---|---|
bin | 1010000110101100011011… |
… | …1000000011100101111001 |
3 | 1110100010011111122110022110 |
4 | 2201223012320003211321 |
5 | 2424012012213323001 |
6 | 35343530344242533 |
7 | 2224452115632066 |
oct | 241530670034571 |
9 | 43303144573273 |
10 | 11110122011001 |
11 | 35a385a264762 |
12 | 12b5271470449 |
13 | 6278abca0300 |
14 | 2a5a38a39c6d |
15 | 143eee3533d6 |
hex | a1ac6e03979 |
11110122011001 has 96 divisors (see below), whose sum is σ = 16845394148352. Its totient is φ = 6497941781760.
The previous prime is 11110122010969. The next prime is 11110122011099. The reversal of 11110122011001 is 10011022101111.
It is not a de Polignac number, because 11110122011001 - 25 = 11110122010969 is a prime.
It is a super-2 number, since 2×111101220110012 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (11110122011201) by changing a digit.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 1185580846 + ... + 1185590216.
It is an arithmetic number, because the mean of its divisors is an integer number (175472855712).
Almost surely, 211110122011001 is an apocalyptic number.
It is an amenable number.
11110122011001 is a deficient number, since it is larger than the sum of its proper divisors (5735272137351).
11110122011001 is a wasteful number, since it uses less digits than its factorization.
11110122011001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10063 (or 10050 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 12.
Adding to 11110122011001 its reverse (10011022101111), we get a palindrome (21121144112112).
The spelling of 11110122011001 in words is "eleven trillion, one hundred ten billion, one hundred twenty-two million, eleven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •