Base | Representation |
---|---|
bin | 1001100110000111101011… |
… | …01010110111000000010110 |
3 | 2202201020101001002220122012 |
4 | 10303003311222313000112 |
5 | 10231204322224324342 |
6 | 112513355510504222 |
7 | 4305332322141326 |
oct | 463036552670026 |
9 | 82636331086565 |
10 | 21101001011222 |
11 | 67a597aa72630 |
12 | 2449622665072 |
13 | ba0a7b591532 |
14 | 52d418657286 |
15 | 268d43667b82 |
hex | 1330f5ab7016 |
21101001011222 has 16 divisors (see below), whose sum is σ = 34639226765712. Its totient is φ = 9560720757120.
The previous prime is 21101001011221. The next prime is 21101001011257. The reversal of 21101001011222 is 22211010010112.
It is a junction number, because it is equal to n+sod(n) for n = 21101001011197 and 21101001011206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21101001011221) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1532159903 + ... + 1532173674.
It is an arithmetic number, because the mean of its divisors is an integer number (2164951672857).
Almost surely, 221101001011222 is an apocalyptic number.
21101001011222 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
21101001011222 is a deficient number, since it is larger than the sum of its proper divisors (13538225754490).
21101001011222 is a wasteful number, since it uses less digits than its factorization.
21101001011222 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3064333903.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 21101001011222 its reverse (22211010010112), we get a palindrome (43312011021334).
It can be divided in two parts, 211010010112 and 22, that multiplied together give a palindrome (4642220222464).
The spelling of 21101001011222 in words is "twenty-one trillion, one hundred one billion, one million, eleven thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •