Base | Representation |
---|---|
bin | 1001100110001001100010… |
… | …01110100000100000110110 |
3 | 2202201022221200021120110020 |
4 | 10303010301032200200312 |
5 | 10231213344023241042 |
6 | 112514043003110010 |
7 | 4305366144203232 |
oct | 463046116404066 |
9 | 82638850246406 |
10 | 21102000212022 |
11 | 67a6342a9aa14 |
12 | 2449861212306 |
13 | ba0baa5aba02 |
14 | 52d4b12375c2 |
15 | 268da123c3ec |
hex | 1331313a0836 |
21102000212022 has 8 divisors (see below), whose sum is σ = 42204000424056. Its totient is φ = 7034000070672.
The previous prime is 21102000212017. The next prime is 21102000212063. The reversal of 21102000212022 is 22021200020112.
It is a sphenic number, since it is the product of 3 distinct primes.
21102000212022 is an admirable number.
It is a super-3 number, since 3×211020002120223 (a number of 41 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 21102000211992 and 21102000212010.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1758500017663 + ... + 1758500017674.
It is an arithmetic number, because the mean of its divisors is an integer number (5275500053007).
Almost surely, 221102000212022 is an apocalyptic number.
21102000212022 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21102000212022 is a wasteful number, since it uses less digits than its factorization.
21102000212022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3517000035342.
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 21102000212022 its reverse (22021200020112), we get a palindrome (43123200232134).
The spelling of 21102000212022 in words is "twenty-one trillion, one hundred two billion, two hundred twelve thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •