Base | Representation |
---|---|
bin | 1010000011110010000111… |
… | …11011000001100111110011 |
3 | 2220022200011020120002010100 |
4 | 11001321003323001213303 |
5 | 10344404203101333021 |
6 | 115013520031003443 |
7 | 4442063462135016 |
oct | 501710373014763 |
9 | 86280136502110 |
10 | 22120221121011 |
11 | 7059151171482 |
12 | 2593069369583 |
13 | c45c0a7a31b0 |
14 | 5668a557337d |
15 | 2855e7446626 |
hex | 141e43ec19f3 |
22120221121011 has 12 divisors (see below), whose sum is σ = 34409232855088. Its totient is φ = 13612443766704.
The previous prime is 22120221121003. The next prime is 22120221121027. The reversal of 22120221121011 is 11012112202122.
22120221121011 is a `hidden beast` number, since 221 + 2 + 0 + 221 + 1 + 210 + 11 = 666.
It is not a de Polignac number, because 22120221121011 - 23 = 22120221121003 is a prime.
It is a super-2 number, since 2×221202211210112 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (22120221121001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 94530859375 + ... + 94530859608.
Almost surely, 222120221121011 is an apocalyptic number.
22120221121011 is a deficient number, since it is larger than the sum of its proper divisors (12289011734077).
22120221121011 is a wasteful number, since it uses less digits than its factorization.
22120221121011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 189061719002 (or 189061718999 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 18.
Adding to 22120221121011 its reverse (11012112202122), we get a palindrome (33132333323133).
The spelling of 22120221121011 in words is "twenty-two trillion, one hundred twenty billion, two hundred twenty-one million, one hundred twenty-one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •