Base | Representation |
---|---|
bin | 11001011101111110100100… |
… | …100000111100001110011100 |
3 | 112200121011111222010222012221 |
4 | 121131332210200330032130 |
5 | 104140142430311223400 |
6 | 1034121123541235124 |
7 | 32410354154323666 |
oct | 3135764440741634 |
9 | 480534458128187 |
10 | 112011212211100 |
11 | 32765763192144 |
12 | 10690634402aa4 |
13 | 4a667c5701567 |
14 | 1d9352b941536 |
15 | ce3a06bebc1a |
hex | 65dfa483c39c |
112011212211100 has 36 divisors (see below), whose sum is σ = 243072529471800. Its totient is φ = 44802973552960.
The previous prime is 112011212211097. The next prime is 112011212211127. The reversal of 112011212211100 is 1112212110211.
It is a super-2 number, since 2×1120112122111002 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 15909910 + ... + 21843709.
It is an arithmetic number, because the mean of its divisors is an integer number (6752014707550).
Almost surely, 2112011212211100 is an apocalyptic number.
112011212211100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
112011212211100 is an abundant number, since it is smaller than the sum of its proper divisors (131061317260700).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112011212211100 is a wasteful number, since it uses less digits than its factorization.
112011212211100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37783302 (or 37783295 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 16.
Adding to 112011212211100 its reverse (1112212110211), we get a palindrome (113123424321311).
The spelling of 112011212211100 in words is "one hundred twelve trillion, eleven billion, two hundred twelve million, two hundred eleven thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •