Base | Representation |
---|---|
bin | 1001100110101111001011… |
… | …11101001101000010101110 |
3 | 2202210021010021202000111010 |
4 | 10303113211331031002232 |
5 | 10232031242312033402 |
6 | 112531224344410050 |
7 | 4310013052352346 |
oct | 463274575150256 |
9 | 82707107660433 |
10 | 21122212221102 |
11 | 6803975164553 |
12 | 2451762176926 |
13 | ba2a7bb86ab5 |
14 | 53046b749d26 |
15 | 2696858d5a6c |
hex | 1335e5f4d0ae |
21122212221102 has 32 divisors (see below), whose sum is σ = 44926246310400. Its totient is φ = 6601407614208.
The previous prime is 21122212221101. The next prime is 21122212221113. The reversal of 21122212221102 is 20112221222112.
It is a super-2 number, since 2×211222122211022 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21122212221101) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 955053702 + ... + 955075817.
It is an arithmetic number, because the mean of its divisors is an integer number (1403945197200).
Almost surely, 221122212221102 is an apocalyptic number.
21122212221102 is an abundant number, since it is smaller than the sum of its proper divisors (23804034089298).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21122212221102 is a wasteful number, since it uses less digits than its factorization.
21122212221102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1910129640.
The product of its (nonzero) digits is 256, while the sum is 21.
Adding to 21122212221102 its reverse (20112221222112), we get a palindrome (41234433443214).
It can be divided in two parts, 2112221222110 and 2, that added together give a palindrome (2112221222112).
The spelling of 21122212221102 in words is "twenty-one trillion, one hundred twenty-two billion, two hundred twelve million, two hundred twenty-one thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •