Base | Representation |
---|---|
bin | 1001100110001000000100… |
… | …10000001001010011110000 |
3 | 2202201020220202022221121200 |
4 | 10303010002100021103300 |
5 | 10231210240300041422 |
6 | 112513432451251200 |
7 | 4305340464361656 |
oct | 463040220112360 |
9 | 82636822287550 |
10 | 21101212112112 |
11 | 67a5a79147880 |
12 | 24496812a9b00 |
13 | ba0ab32344c2 |
14 | 52d4386c8dd6 |
15 | 268d56e662ac |
hex | 1331024094f0 |
21101212112112 has 120 divisors (see below), whose sum is σ = 64423786600368. Its totient is φ = 6394192896000.
The previous prime is 21101212112089. The next prime is 21101212112129. The reversal of 21101212112112 is 21121121210112.
It is a happy number.
It is a super-2 number, since 2×211012121121122 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 144852112 + ... + 144997712.
Almost surely, 221101212112112 is an apocalyptic number.
21101212112112 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
21101212112112 is an abundant number, since it is smaller than the sum of its proper divisors (43322574488256).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21101212112112 is a wasteful number, since it uses less digits than its factorization.
21101212112112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 237119 (or 237110 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 18.
Adding to 21101212112112 its reverse (21121121210112), we get a palindrome (42222333322224).
The spelling of 21101212112112 in words is "twenty-one trillion, one hundred one billion, two hundred twelve million, one hundred twelve thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •