Base | Representation |
---|---|
bin | 100000010101011010111… |
… | …100111101100000000011 |
3 | 21212102102200012202221201 |
4 | 200111122330331200003 |
5 | 242401201122201034 |
6 | 4420441142202031 |
7 | 316351553360554 |
oct | 40253274754003 |
9 | 7772380182851 |
10 | 2222024022019 |
11 | 78739a6a577a |
12 | 2ba787423317 |
13 | 1316c7696529 |
14 | 797919a632b |
15 | 3cbeec28014 |
hex | 2055af3d803 |
2222024022019 has 4 divisors (see below), whose sum is σ = 2222027021160. Its totient is φ = 2222021022880.
The previous prime is 2222024022013. The next prime is 2222024022061. The reversal of 2222024022019 is 9102204202222.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2222024022019 is a prime.
It is a super-2 number, since 2×22220240220192 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2222024022013) 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, 504747 + ... + 2167675.
It is an arithmetic number, because the mean of its divisors is an integer number (555506755290).
Almost surely, 22222024022019 is an apocalyptic number.
2222024022019 is a deficient number, since it is larger than the sum of its proper divisors (2999141).
2222024022019 is a wasteful number, since it uses less digits than its factorization.
2222024022019 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2999140.
The product of its (nonzero) digits is 4608, while the sum is 28.
The spelling of 2222024022019 in words is "two trillion, two hundred twenty-two billion, twenty-four million, twenty-two thousand, nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •