Base | Representation |
---|---|
bin | 1010000011001100011110… |
… | …10100010101010100011011 |
3 | 2220020201222210001020010010 |
4 | 11001212033110111110123 |
5 | 10344041310332210021 |
6 | 115000334402253003 |
7 | 4440446610544500 |
oct | 501461724252433 |
9 | 86221883036103 |
10 | 22100011210011 |
11 | 7050620200199 |
12 | 258b169057163 |
13 | c44039781087 |
14 | 5659094494a7 |
15 | 284d13064976 |
hex | 14198f51551b |
22100011210011 has 12 divisors (see below), whose sum is σ = 34277568407592. Its totient is φ = 12628577834208.
The previous prime is 22100011210009. The next prime is 22100011210037. The reversal of 22100011210011 is 11001211000122.
It is not a de Polignac number, because 22100011210011 - 21 = 22100011210009 is a prime.
It is a super-2 number, since 2×221000112100112 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (22100011210411) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 75170106010 + ... + 75170106303.
It is an arithmetic number, because the mean of its divisors is an integer number (2856464033966).
Almost surely, 222100011210011 is an apocalyptic number.
22100011210011 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
22100011210011 is a deficient number, since it is larger than the sum of its proper divisors (12177557197581).
22100011210011 is a wasteful number, since it uses less digits than its factorization.
22100011210011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 150340212330 (or 150340212323 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 22100011210011 its reverse (11001211000122), we get a palindrome (33101222210133).
The spelling of 22100011210011 in words is "twenty-two trillion, one hundred billion, eleven million, two hundred ten thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •