Base | Representation |
---|---|
bin | 1010000110001000111111… |
… | …11001100010101100000101 |
3 | 2220121102020021100220221210 |
4 | 11003010133321202230011 |
5 | 10402221100102143023 |
6 | 115115033350202033 |
7 | 4450661645641461 |
oct | 503043771425405 |
9 | 86542207326853 |
10 | 22201221131013 |
11 | 708a5375a8901 |
12 | 25a68b4053319 |
13 | c50748b498b2 |
14 | 56a78b05d4a1 |
15 | 2877885e9593 |
hex | 14311fe62b05 |
22201221131013 has 4 divisors (see below), whose sum is σ = 29601628174688. Its totient is φ = 14800814087340.
The previous prime is 22201221131003. The next prime is 22201221131027. The reversal of 22201221131013 is 31013112210222.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 22201221131013 - 25 = 22201221130981 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22201221131003) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3700203521833 + ... + 3700203521838.
It is an arithmetic number, because the mean of its divisors is an integer number (7400407043672).
Almost surely, 222201221131013 is an apocalyptic number.
It is an amenable number.
22201221131013 is a deficient number, since it is larger than the sum of its proper divisors (7400407043675).
22201221131013 is an equidigital number, since it uses as much as digits as its factorization.
22201221131013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7400407043674.
The product of its (nonzero) digits is 288, while the sum is 21.
Adding to 22201221131013 its reverse (31013112210222), we get a palindrome (53214333341235).
The spelling of 22201221131013 in words is "twenty-two trillion, two hundred one billion, two hundred twenty-one million, one hundred thirty-one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •