Base | Representation |
---|---|
bin | 1010000000111111101101… |
… | …11100101110110010100110 |
3 | 2212222111221010022110012012 |
4 | 11000133312330232302212 |
5 | 10341322023223121042 |
6 | 114501515510354222 |
7 | 4432133110610654 |
oct | 500376674566246 |
9 | 85874833273165 |
10 | 22024440442022 |
11 | 70215704a9737 |
12 | 257859865b972 |
13 | c39b85175805 |
14 | 561dbaa37dd4 |
15 | 282d8d855e82 |
hex | 1407f6f2eca6 |
22024440442022 has 8 divisors (see below), whose sum is σ = 34175855858400. Its totient is φ = 10632488489224.
The previous prime is 22024440442001. The next prime is 22024440442027. The reversal of 22024440442022 is 22024404442022.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a self number, because there is not a number n which added to its sum of digits gives 22024440442022.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22024440442027) 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, 189865865822 + ... + 189865865937.
It is an arithmetic number, because the mean of its divisors is an integer number (4271981982300).
Almost surely, 222024440442022 is an apocalyptic number.
22024440442022 is a deficient number, since it is larger than the sum of its proper divisors (12151415416378).
22024440442022 is a wasteful number, since it uses less digits than its factorization.
22024440442022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 379731731790.
The product of its (nonzero) digits is 65536, while the sum is 32.
Adding to 22024440442022 its reverse (22024404442022), we get a palindrome (44048844884044).
Subtracting from 22024440442022 its reverse (22024404442022), we obtain a square (36000000 = 60002).
The spelling of 22024440442022 in words is "twenty-two trillion, twenty-four billion, four hundred forty million, four hundred forty-two thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •