Base | Representation |
---|---|
bin | 1010000100000100100010… |
… | …11110111101011010111011 |
3 | 2220100121200120121002222111 |
4 | 11002002101132331122323 |
5 | 10400034432223234321 |
6 | 115022233325433151 |
7 | 4442563546014256 |
oct | 502022136753273 |
9 | 86317616532874 |
10 | 22130112321211 |
11 | 70623675245a4 |
12 | 2594b69a0b7b7 |
13 | c46b25a8868b |
14 | 56716309409d |
15 | 2859c59b25e1 |
hex | 1420917bd6bb |
22130112321211 has 4 divisors (see below), whose sum is σ = 22253744233800. Its totient is φ = 22006480408624.
The previous prime is 22130112321091. The next prime is 22130112321227. The reversal of 22130112321211 is 11212321103122.
It is a happy number.
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 22130112321211 - 211 = 22130112319163 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (22130112331211) 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 3 ways as a sum of consecutive naturals, for example, 61815956026 + ... + 61815956383.
It is an arithmetic number, because the mean of its divisors is an integer number (5563436058450).
Almost surely, 222130112321211 is an apocalyptic number.
22130112321211 is a deficient number, since it is larger than the sum of its proper divisors (123631912589).
22130112321211 is a wasteful number, since it uses less digits than its factorization.
22130112321211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 123631912588.
The product of its (nonzero) digits is 288, while the sum is 22.
Adding to 22130112321211 its reverse (11212321103122), we get a palindrome (33342433424333).
The spelling of 22130112321211 in words is "twenty-two trillion, one hundred thirty billion, one hundred twelve million, three hundred twenty-one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •