Base | Representation |
---|---|
bin | 1100110011111100001… |
… | …1000100010111011110 |
3 | 210001010020001102021110 |
4 | 3030333003010113132 |
5 | 12101231340213042 |
6 | 245040230242450 |
7 | 21621211330035 |
oct | 3147703042736 |
9 | 701106042243 |
10 | 220101101022 |
11 | 85387373990 |
12 | 367a74b6426 |
13 | 179a89347aa |
14 | a91d9a371c |
15 | 5ad301109c |
hex | 333f0c45de |
220101101022 has 64 divisors (see below), whose sum is σ = 498083240448. Its totient is φ = 64252080000.
The previous prime is 220101101009. The next prime is 220101101023.
220101101022 is nontrivially palindromic in base 10.
It is a junction number, because it is equal to n+sod(n) for n = 220101100989 and 220101101007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (220101101023) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 199554 + ... + 692837.
It is an arithmetic number, because the mean of its divisors is an integer number (7782550632).
Almost surely, 2220101101022 is an apocalyptic number.
220101101022 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
220101101022 is an abundant number, since it is smaller than the sum of its proper divisors (277982139426).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
220101101022 is a wasteful number, since it uses less digits than its factorization.
220101101022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 892545.
The product of its (nonzero) digits is 16, while the sum is 12.
It can be divided in two parts, 220101 and 101022, that added together give a palindrome (321123).
The spelling of 220101101022 in words is "two hundred twenty billion, one hundred one million, one hundred one thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •