Base | Representation |
---|---|
bin | 1001101001101001001111… |
… | …01110111011001100000110 |
3 | 2210010210221122021001112100 |
4 | 10310310213232323030012 |
5 | 10240200330101201042 |
6 | 113045144222532530 |
7 | 4320150264560004 |
oct | 464644756731406 |
9 | 83123848231470 |
10 | 21222100022022 |
11 | 6842273226839 |
12 | 2468b9a437146 |
13 | bac30a371243 |
14 | 535225921a74 |
15 | 26c07ed5b24c |
hex | 134d27bbb306 |
21222100022022 has 24 divisors (see below), whose sum is σ = 48401280752760. Its totient is φ = 6701715796320.
The previous prime is 21222100022009. The next prime is 21222100022077. The reversal of 21222100022022 is 22022000122212.
21222100022022 is a `hidden beast` number, since 212 + 2 + 210 + 0 + 0 + 220 + 22 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 21222100021986 and 21222100022004.
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, 31026461679 + ... + 31026462362.
It is an arithmetic number, because the mean of its divisors is an integer number (2016720031365).
Almost surely, 221222100022022 is an apocalyptic number.
21222100022022 is an abundant number, since it is smaller than the sum of its proper divisors (27179180730738).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21222100022022 is a wasteful number, since it uses less digits than its factorization.
21222100022022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 62052924068 (or 62052924065 counting only the distinct ones).
The product of its (nonzero) digits is 256, while the sum is 18.
Adding to 21222100022022 its reverse (22022000122212), we get a palindrome (43244100144234).
The spelling of 21222100022022 in words is "twenty-one trillion, two hundred twenty-two billion, one hundred million, twenty-two thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •