Base | Representation |
---|---|
bin | 1010000001000001001100… |
… | …00001001111100111100100 |
3 | 2212222120222011021222122211 |
4 | 11000200212001033213210 |
5 | 10341330132404413322 |
6 | 114502130120533204 |
7 | 4432161510215605 |
oct | 500404601174744 |
9 | 85876864258584 |
10 | 22025230154212 |
11 | 702193625313a |
12 | 2578779021204 |
13 | c39c7c965b2c |
14 | 562053885dac |
15 | 282dd7d49b77 |
hex | 14082604f9e4 |
22025230154212 has 12 divisors (see below), whose sum is σ = 38544499804860. Its totient is φ = 11012515924256.
The previous prime is 22025230154177. The next prime is 22025230154219. The reversal of 22025230154212 is 21245103252022.
It can be written as a sum of positive squares in 2 ways, for example, as 11832113966656 + 10193116187556 = 3439784^2 + 3192666^2 .
It is a super-2 number, since 2×220252301542122 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (22025230154219) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 24287287 + ... + 25177822.
It is an arithmetic number, because the mean of its divisors is an integer number (3212041650405).
Almost surely, 222025230154212 is an apocalyptic number.
It is an amenable number.
22025230154212 is a deficient number, since it is larger than the sum of its proper divisors (16519269650648).
22025230154212 is a wasteful number, since it uses less digits than its factorization.
22025230154212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 49576430 (or 49576428 counting only the distinct ones).
The product of its (nonzero) digits is 19200, while the sum is 31.
The spelling of 22025230154212 in words is "twenty-two trillion, twenty-five billion, two hundred thirty million, one hundred fifty-four thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •