Base | Representation |
---|---|
bin | 10010110100101011… |
… | …001111000101000110 |
3 | 1221011112202100210011 |
4 | 102310223033011012 |
5 | 312343020231042 |
6 | 13141310020434 |
7 | 1313564350456 |
oct | 226453170506 |
9 | 57145670704 |
10 | 20211102022 |
11 | 8631705101 |
12 | 3b007a771a |
13 | 1ba134b287 |
14 | d9a357d66 |
15 | 7d4569a17 |
hex | 4b4acf146 |
20211102022 has 4 divisors (see below), whose sum is σ = 30316653036. Its totient is φ = 10105551010.
The previous prime is 20211102019. The next prime is 20211102031. The reversal of 20211102022 is 22020111202.
It is a happy number.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 22020111202 = 2 ⋅11010055601.
It is a super-3 number, since 3×202111020223 (a number of 32 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 20211101993 and 20211102011.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5052775504 + ... + 5052775507.
It is an arithmetic number, because the mean of its divisors is an integer number (7579163259).
Almost surely, 220211102022 is an apocalyptic number.
20211102022 is a deficient number, since it is larger than the sum of its proper divisors (10105551014).
20211102022 is a wasteful number, since it uses less digits than its factorization.
20211102022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10105551013.
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 20211102022 its reverse (22020111202), we get a palindrome (42231213224).
It can be divided in two parts, 202 and 11102022, that added together give a square (11102224 = 33322).
The spelling of 20211102022 in words is "twenty billion, two hundred eleven million, one hundred two thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •