Base | Representation |
---|---|
bin | 1010000000010110001010… |
… | …01100111110001101110101 |
3 | 2212220101100100011111010022 |
4 | 11000023011030332031311 |
5 | 10340440331014032404 |
6 | 114443350041534525 |
7 | 4430413213525310 |
oct | 500130514761565 |
9 | 85811310144108 |
10 | 22002131002229 |
11 | 70130623a1394 |
12 | 25741b11a4445 |
13 | c37a3b19c171 |
14 | 560ca1b47977 |
15 | 2824d4ea18be |
hex | 1402c533e375 |
22002131002229 has 4 divisors (see below), whose sum is σ = 25145292573984. Its totient is φ = 18858969430476.
The previous prime is 22002131002219. The next prime is 22002131002237. The reversal of 22002131002229 is 92220013120022.
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 22002131002229 - 216 = 22002130936693 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 22002131002198 and 22002131002207.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22002131002219) 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, 1571580785867 + ... + 1571580785880.
It is an arithmetic number, because the mean of its divisors is an integer number (6286323143496).
Almost surely, 222002131002229 is an apocalyptic number.
It is an amenable number.
22002131002229 is a deficient number, since it is larger than the sum of its proper divisors (3143161571755).
22002131002229 is an equidigital number, since it uses as much as digits as its factorization.
22002131002229 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3143161571754.
The product of its (nonzero) digits is 1728, while the sum is 26.
The spelling of 22002131002229 in words is "twenty-two trillion, two billion, one hundred thirty-one million, two thousand, two hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •