Base | Representation |
---|---|
bin | 1001100011110100100011… |
… | …00000010101100110010110 |
3 | 2202102200111002200200102021 |
4 | 10301322101200111212112 |
5 | 10223411034321320042 |
6 | 112413213435203354 |
7 | 4266535014142333 |
oct | 461722140254626 |
9 | 82380432620367 |
10 | 21022011120022 |
11 | 6775426264210 |
12 | 2436258ba655a |
13 | b964a07c5b43 |
14 | 529683adb98a |
15 | 266c6dbc5867 |
hex | 131e91815996 |
21022011120022 has 8 divisors (see below), whose sum is σ = 34399654560072. Its totient is φ = 9555459600000.
The previous prime is 21022011119999. The next prime is 21022011120041. The reversal of 21022011120022 is 22002111022012.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 21022011119978 and 21022011120005.
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, 477772979979 + ... + 477772980022.
It is an arithmetic number, because the mean of its divisors is an integer number (4299956820009).
Almost surely, 221022011120022 is an apocalyptic number.
21022011120022 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
21022011120022 is a deficient number, since it is larger than the sum of its proper divisors (13377643440050).
21022011120022 is a wasteful number, since it uses less digits than its factorization.
21022011120022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 955545960014.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 21022011120022 its reverse (22002111022012), we get a palindrome (43024122142034).
It can be divided in two parts, 2102201 and 1120022, that added together give a palindrome (3222223).
The spelling of 21022011120022 in words is "twenty-one trillion, twenty-two billion, eleven million, one hundred twenty thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •