Base | Representation |
---|---|
bin | 10010110101010001… |
… | …011000110000001000 |
3 | 1221012020120110200220 |
4 | 102311101120300020 |
5 | 312403100244422 |
6 | 13142304230040 |
7 | 1314045353250 |
oct | 226521306010 |
9 | 57166513626 |
10 | 20221103112 |
11 | 8637316071 |
12 | 3b0400b320 |
13 | 1ba3440492 |
14 | d9b7dc960 |
15 | 7d5392e5c |
hex | 4b5458c08 |
20221103112 has 32 divisors (see below), whose sum is σ = 57774580800. Its totient is φ = 5777457984.
The previous prime is 20221103053. The next prime is 20221103113. The reversal of 20221103112 is 21130112202.
It is a super-2 number, since 2×202211031122 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 20221103091 and 20221103100.
It is not an unprimeable number, because it can be changed into a prime (20221103113) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 60181687 + ... + 60182022.
It is an arithmetic number, because the mean of its divisors is an integer number (1805455650).
Almost surely, 220221103112 is an apocalyptic number.
It is an amenable number.
20221103112 is an abundant number, since it is smaller than the sum of its proper divisors (37553477688).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20221103112 is a wasteful number, since it uses less digits than its factorization.
20221103112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 120363725 (or 120363721 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 20221103112 its reverse (21130112202), we get a palindrome (41351215314).
The spelling of 20221103112 in words is "twenty billion, two hundred twenty-one million, one hundred three thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •