Base | Representation |
---|---|
bin | 11101011011010100101… |
… | …00111111001011011000 |
3 | 10120122211101021212112210 |
4 | 32231222110333023120 |
5 | 113031213401413422 |
6 | 2052254331435120 |
7 | 133023013255602 |
oct | 16555224771330 |
9 | 3518741255483 |
10 | 1011101201112 |
11 | 35a8952a5672 |
12 | 143b5b8b5aa0 |
13 | 744671675b2 |
14 | 36d1a93c172 |
15 | 1b47b14610c |
hex | eb6a53f2d8 |
1011101201112 has 16 divisors (see below), whose sum is σ = 2527753002840. Its totient is φ = 337033733696.
The previous prime is 1011101201041. The next prime is 1011101201113. The reversal of 1011101201112 is 2111021011101.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1011101201113) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 21064608333 + ... + 21064608380.
Almost surely, 21011101201112 is an apocalyptic number.
1011101201112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1011101201112 is an abundant number, since it is smaller than the sum of its proper divisors (1516651801728).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1011101201112 is a wasteful number, since it uses less digits than its factorization.
1011101201112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 42129216722 (or 42129216718 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 12.
Adding to 1011101201112 its reverse (2111021011101), we get a palindrome (3122122212213).
The spelling of 1011101201112 in words is "one trillion, eleven billion, one hundred one million, two hundred one thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •