Base | Representation |
---|---|
bin | 1010000110001001001101… |
… | …11110111111101100000111 |
3 | 2220121102112120001010222001 |
4 | 11003010212332333230013 |
5 | 10402221321020013111 |
6 | 115115053234050131 |
7 | 4450664621215342 |
oct | 503044676775407 |
9 | 86542476033861 |
10 | 22201340001031 |
11 | 708a598708694 |
12 | 25a6927a19947 |
13 | c50767669399 |
14 | 56a79cb63459 |
15 | 287793c7a1c1 |
hex | 143126fbfb07 |
22201340001031 has 4 divisors (see below), whose sum is σ = 22201367205600. Its totient is φ = 22201312796464.
The previous prime is 22201340000969. The next prime is 22201340001053. The reversal of 22201340001031 is 13010004310222.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-22201340001031 is a prime.
It is a super-2 number, since 2×222013400010312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22201340001091) 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, 12339046 + ... + 14023363.
It is an arithmetic number, because the mean of its divisors is an integer number (5550341801400).
Almost surely, 222201340001031 is an apocalyptic number.
22201340001031 is a deficient number, since it is larger than the sum of its proper divisors (27204569).
22201340001031 is an equidigital number, since it uses as much as digits as its factorization.
22201340001031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27204568.
The product of its (nonzero) digits is 288, while the sum is 19.
Adding to 22201340001031 its reverse (13010004310222), we get a palindrome (35211344311253).
The spelling of 22201340001031 in words is "twenty-two trillion, two hundred one billion, three hundred forty million, one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •