Base | Representation |
---|---|
bin | 1010000011100011000010… |
… | …01000010010000101110011 |
3 | 2220021220020202010111202022 |
4 | 11001301201020102011303 |
5 | 10344241111011413021 |
6 | 115010100201342055 |
7 | 4441355656014632 |
oct | 501614110220563 |
9 | 86256222114668 |
10 | 22112121201011 |
11 | 7055774a57716 |
12 | 259158879792b |
13 | c45219646b1a |
14 | 5663378d9519 |
15 | 2852c12b01ab |
hex | 141c61212173 |
22112121201011 has 4 divisors (see below), whose sum is σ = 23073517774992. Its totient is φ = 21150724627032.
The previous prime is 22112121201007. The next prime is 22112121201017. The reversal of 22112121201011 is 11010212121122.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 22112121201011 - 22 = 22112121201007 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (22112121201017) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 480698286956 + ... + 480698287001.
It is an arithmetic number, because the mean of its divisors is an integer number (5768379443748).
Almost surely, 222112121201011 is an apocalyptic number.
22112121201011 is a deficient number, since it is larger than the sum of its proper divisors (961396573981).
22112121201011 is an equidigital number, since it uses as much as digits as its factorization.
22112121201011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 961396573980.
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 22112121201011 its reverse (11010212121122), we get a palindrome (33122333322133).
The spelling of 22112121201011 in words is "twenty-two trillion, one hundred twelve billion, one hundred twenty-one million, two hundred one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •