Base | Representation |
---|---|
bin | 1001100110011100001011… |
… | …11011000101111001010100 |
3 | 2202202021210100120101210122 |
4 | 10303032011323011321110 |
5 | 10231344344321321322 |
6 | 112522420215411112 |
7 | 4306202213416415 |
oct | 463160573057124 |
9 | 82667710511718 |
10 | 21112011120212 |
11 | 67aa60a985461 |
12 | 244b795983a98 |
13 | ba1b1461821c |
14 | 52db809d980c |
15 | 26928a052442 |
hex | 133385ec5e54 |
21112011120212 has 6 divisors (see below), whose sum is σ = 36946019460378. Its totient is φ = 10556005560104.
The previous prime is 21112011120203. The next prime is 21112011120251. The reversal of 21112011120212 is 21202111021112.
It can be written as a sum of positive squares in only one way, i.e., 16594575438736 + 4517435681476 = 4073644^2 + 2125426^2 .
It is a super-2 number, since 2×211120111202122 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
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 as a sum of consecutive naturals, namely, 2639001390023 + ... + 2639001390030.
It is an arithmetic number, because the mean of its divisors is an integer number (6157669910063).
Almost surely, 221112011120212 is an apocalyptic number.
It is an amenable number.
21112011120212 is a deficient number, since it is larger than the sum of its proper divisors (15834008340166).
21112011120212 is a wasteful number, since it uses less digits than its factorization.
21112011120212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5278002780057 (or 5278002780055 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 21112011120212 its reverse (21202111021112), we get a palindrome (42314122141324).
The spelling of 21112011120212 in words is "twenty-one trillion, one hundred twelve billion, eleven million, one hundred twenty thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •