Base | Representation |
---|---|
bin | 1010000000100101001101… |
… | …10100011110111111111110 |
3 | 2212221011012110111010002021 |
4 | 11000102212310132333332 |
5 | 10341103403031413042 |
6 | 114451203524350354 |
7 | 4431120360220222 |
oct | 500224664367776 |
9 | 85834173433067 |
10 | 22010211201022 |
11 | 7016529466330 |
12 | 25758872453ba |
13 | c38728211c95 |
14 | 56142ad2a782 |
15 | 28280953e867 |
hex | 1404a6d1effe |
22010211201022 has 8 divisors (see below), whose sum is σ = 36016709238072. Its totient is φ = 10004641455000.
The previous prime is 22010211200977. The next prime is 22010211201049.
It is a happy number.
22010211201022 is nontrivially palindromic in base 10.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×220102112010222 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 22010211200987 and 22010211201005.
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, 500232072729 + ... + 500232072772.
It is an arithmetic number, because the mean of its divisors is an integer number (4502088654759).
Almost surely, 222010211201022 is an apocalyptic number.
22010211201022 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
22010211201022 is a deficient number, since it is larger than the sum of its proper divisors (14006498037050).
22010211201022 is a wasteful number, since it uses less digits than its factorization.
22010211201022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1000464145514.
The product of its (nonzero) digits is 64, while the sum is 16.
It can be divided in two parts, 2201021 and 1201022, that added together give a palindrome (3402043).
The spelling of 22010211201022 in words is "twenty-two trillion, ten billion, two hundred eleven million, two hundred one thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.133 sec. • engine limits •