Base | Representation |
---|---|
bin | 10100101100011111… |
… | …100100110101100011 |
3 | 2010100122022120112210 |
4 | 110230133210311203 |
5 | 331002123430311 |
6 | 14112555453203 |
7 | 1414444013142 |
oct | 245437446543 |
9 | 63318276483 |
10 | 22221311331 |
11 | 947339510a |
12 | 4381a57203 |
13 | 213195b53b |
14 | 110b30d759 |
15 | 8a0c973a6 |
hex | 52c7e4d63 |
22221311331 has 4 divisors (see below), whose sum is σ = 29628415112. Its totient is φ = 14814207552.
The previous prime is 22221311327. The next prime is 22221311347. The reversal of 22221311331 is 13311312222.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 22221311331 - 22 = 22221311327 is a prime.
It is a super-2 number, since 2×222213113312 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 22221311298 and 22221311307.
It is not an unprimeable number, because it can be changed into a prime (22221311351) 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 3 ways as a sum of consecutive naturals, for example, 3703551886 + ... + 3703551891.
It is an arithmetic number, because the mean of its divisors is an integer number (7407103778).
Almost surely, 222221311331 is an apocalyptic number.
22221311331 is a deficient number, since it is larger than the sum of its proper divisors (7407103781).
22221311331 is an equidigital number, since it uses as much as digits as its factorization.
22221311331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7407103780.
The product of its digits is 432, while the sum is 21.
Adding to 22221311331 its reverse (13311312222), we get a palindrome (35532623553).
The spelling of 22221311331 in words is "twenty-two billion, two hundred twenty-one million, three hundred eleven thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •