Base | Representation |
---|---|
bin | 1010000110001010011101… |
… | …0010011011101101001011 |
3 | 1110022020121220221222210002 |
4 | 2201202213102123231023 |
5 | 2423334323020320021 |
6 | 35335421401313215 |
7 | 2224010116062446 |
oct | 241424722335513 |
9 | 43266556858702 |
10 | 11101002120011 |
11 | 359a9aa326671 |
12 | 12b354719580b |
13 | 626a877338cb |
14 | 2a541173665d |
15 | 143b6889350b |
hex | a18a749bb4b |
11101002120011 has 24 divisors (see below), whose sum is σ = 11607161112000. Its totient is φ = 10615214332800.
The previous prime is 11101002120007. The next prime is 11101002120031. The reversal of 11101002120011 is 11002120010111.
11101002120011 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 11101002120011 - 22 = 11101002120007 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11101002119974 and 11101002120001.
It is not an unprimeable number, because it can be changed into a prime (11101002120031) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 132442526 + ... + 132526316.
It is an arithmetic number, because the mean of its divisors is an integer number (483631713000).
Almost surely, 211101002120011 is an apocalyptic number.
11101002120011 is a deficient number, since it is larger than the sum of its proper divisors (506158991989).
11101002120011 is an equidigital number, since it uses as much as digits as its factorization.
11101002120011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 85491 (or 85460 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 11101002120011 its reverse (11002120010111), we get a palindrome (22103122130122).
The spelling of 11101002120011 in words is "eleven trillion, one hundred one billion, two million, one hundred twenty thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •