Base | Representation |
---|---|
bin | 1010000111010001001110… |
… | …1101110010110011010100 |
3 | 1110101001122222220020010002 |
4 | 2201310103231302303110 |
5 | 2424142230240213022 |
6 | 35352242531350432 |
7 | 2225251664542556 |
oct | 241642355626324 |
9 | 43331588806102 |
10 | 11120001101012 |
11 | 35a7a697a6261 |
12 | 12b7169a52418 |
13 | 6287c49055bb |
14 | 2a62d4ac74d6 |
15 | 1443cb7cb092 |
hex | a1d13b72cd4 |
11120001101012 has 12 divisors (see below), whose sum is σ = 20131036476180. Its totient is φ = 5368276393536.
The previous prime is 11120001101003. The next prime is 11120001101101. The reversal of 11120001101012 is 21010110002111.
11120001101012 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 8208247920016 + 2911753180996 = 2865004^2 + 1706386^2 .
It is a junction number, because it is equal to n+sod(n) for n = 11120001100984 and 11120001101002.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 47931039113 + ... + 47931039344.
It is an arithmetic number, because the mean of its divisors is an integer number (1677586373015).
Almost surely, 211120001101012 is an apocalyptic number.
It is an amenable number.
11120001101012 is a deficient number, since it is larger than the sum of its proper divisors (9011035375168).
11120001101012 is a wasteful number, since it uses less digits than its factorization.
11120001101012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 95862078490 (or 95862078488 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 11120001101012 its reverse (21010110002111), we get a palindrome (32130111103123).
The spelling of 11120001101012 in words is "eleven trillion, one hundred twenty billion, one million, one hundred one thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •