Base | Representation |
---|---|
bin | 1010000000100110101011… |
… | …10101111001010010100000 |
3 | 2212221020020102221100000221 |
4 | 11000103111311321102200 |
5 | 10341112012011200000 |
6 | 114451414105252424 |
7 | 4431146046600232 |
oct | 500232565712240 |
9 | 85836212840027 |
10 | 22011000100000 |
11 | 70168a380485a |
12 | 2575a67494114 |
13 | c388227a9102 |
14 | 5614a3a06252 |
15 | 28285392261a |
hex | 1404d5d794a0 |
22011000100000 has 72 divisors (see below), whose sum is σ = 54164229072156. Its totient is φ = 8804400000000.
The previous prime is 22011000099973. The next prime is 22011000100007. The reversal of 22011000100000 is 100011022.
It can be written as a sum of positive squares in 6 ways, for example, as 20940405264 + 21990059694736 = 144708^2 + 4689356^2 .
It is not an unprimeable number, because it can be changed into a prime (22011000100007) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 109955001 + ... + 110155000.
Almost surely, 222011000100000 is an apocalyptic number.
22011000100000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
22011000100000 is an abundant number, since it is smaller than the sum of its proper divisors (32153228972156).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
22011000100000 is an frugal number, since it uses more digits than its factorization.
22011000100000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 220110036 (or 220110008 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 7.
Adding to 22011000100000 its reverse (100011022), we get a palindrome (22011100111022).
The spelling of 22011000100000 in words is "twenty-two trillion, eleven billion, one hundred thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •