Base | Representation |
---|---|
bin | 1010000110001000100110… |
… | …11000010110000110010100 |
3 | 2220121101200122011100110011 |
4 | 11003010103120112012110 |
5 | 10402220132320231400 |
6 | 115115000444410004 |
7 | 4450653515504335 |
oct | 503042330260624 |
9 | 86541618140404 |
10 | 22201011102100 |
11 | 708a439a95a96 |
12 | 25a6855846904 |
13 | c5071449082c |
14 | 56a76b1ca28c |
15 | 287774e5d8ba |
hex | 143113616194 |
22201011102100 has 18 divisors (see below), whose sum is σ = 48176194091774. Its totient is φ = 8880404440800.
The previous prime is 22201011102091. The next prime is 22201011102143. The reversal of 22201011102100 is 120111010222.
It can be written as a sum of positive squares in 3 ways, for example, as 14669085456 + 22186342016644 = 121116^2 + 4710238^2 .
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 in 5 ways as a sum of consecutive naturals, for example, 111005055411 + ... + 111005055610.
Almost surely, 222201011102100 is an apocalyptic number.
22201011102100 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
22201011102100 is an abundant number, since it is smaller than the sum of its proper divisors (25975182989674).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
22201011102100 is a wasteful number, since it uses less digits than its factorization.
22201011102100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 222010111035 (or 222010111028 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 22201011102100 its reverse (120111010222), we get a palindrome (22321122112322).
The spelling of 22201011102100 in words is "twenty-two trillion, two hundred one billion, eleven million, one hundred two thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •