Base | Representation |
---|---|
bin | 1001001001010001111110… |
… | …10111100011111100011110 |
3 | 2122012111200110002002002010 |
4 | 10210220333113203330132 |
5 | 10113440441101133042 |
6 | 110434241415412050 |
7 | 4143623011532544 |
oct | 444507727437436 |
9 | 78174613062063 |
10 | 20110100021022 |
11 | 6453711213450 |
12 | 230957b984026 |
13 | b2b4b3430b7b |
14 | 4d7496839d94 |
15 | 24d19ab3959c |
hex | 124a3f5e3f1e |
20110100021022 has 16 divisors (see below), whose sum is σ = 43876581864192. Its totient is φ = 6093969703320.
The previous prime is 20110100020991. The next prime is 20110100021059. The reversal of 20110100021022 is 22012000101102.
It is a super-2 number, since 2×201101000210222 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 20110100020989 and 20110100021007.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 152349242518 + ... + 152349242649.
It is an arithmetic number, because the mean of its divisors is an integer number (2742286366512).
Almost surely, 220110100021022 is an apocalyptic number.
20110100021022 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
20110100021022 is an abundant number, since it is smaller than the sum of its proper divisors (23766481843170).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20110100021022 is a wasteful number, since it uses less digits than its factorization.
20110100021022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 304698485183.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 20110100021022 its reverse (22012000101102), we get a palindrome (42122100122124).
The spelling of 20110100021022 in words is "twenty trillion, one hundred ten billion, one hundred million, twenty-one thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •