Base | Representation |
---|---|
bin | 10000000001011001011… |
… | …000000101000010110000 |
3 | 10220020220100122120210111 |
4 | 100001121120011002300 |
5 | 121014332321041422 |
6 | 2201444133111104 |
7 | 142355040016162 |
oct | 20013130050260 |
9 | 3806810576714 |
10 | 1101011112112 |
11 | 394a3308453a |
12 | 159472488494 |
13 | 7ca95406272 |
14 | 3b4098a8932 |
15 | 1d98e629a77 |
hex | 100596050b0 |
1101011112112 has 80 divisors (see below), whose sum is σ = 2311751895552. Its totient is φ = 505956971520.
The previous prime is 1101011112109. The next prime is 1101011112203. The reversal of 1101011112112 is 2112111101011.
It is a super-3 number, since 3×11010111121123 (a number of 37 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1101011112092 and 1101011112101.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 70250037 + ... + 70265707.
Almost surely, 21101011112112 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1101011112112, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1155875947776).
1101011112112 is an abundant number, since it is smaller than the sum of its proper divisors (1210740783440).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1101011112112 is a wasteful number, since it uses less digits than its factorization.
1101011112112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 21746 (or 21740 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 13.
Adding to 1101011112112 its reverse (2112111101011), we get a palindrome (3213122213123).
The spelling of 1101011112112 in words is "one trillion, one hundred one billion, eleven million, one hundred twelve thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •