Base | Representation |
---|---|
bin | 1100111011001011010… |
… | …0011100000110100110 |
3 | 210020010120212121022202 |
4 | 3032302310130012212 |
5 | 12114221104020032 |
6 | 250001053054502 |
7 | 22020304645532 |
oct | 3166264340646 |
9 | 706116777282 |
10 | 222043423142 |
11 | 861937a6282 |
12 | 37049a87432 |
13 | 17c28165b18 |
14 | aa65926bc2 |
15 | 5b987cdd62 |
hex | 33b2d1c1a6 |
222043423142 has 8 divisors (see below), whose sum is σ = 333067665432. Its totient is φ = 111020868000.
The previous prime is 222043423141. The next prime is 222043423159. The reversal of 222043423142 is 241324340222.
222043423142 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×2220434231422 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (222043423141) 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, 13859 + ... + 666542.
It is an arithmetic number, because the mean of its divisors is an integer number (41633458179).
Almost surely, 2222043423142 is an apocalyptic number.
222043423142 is a deficient number, since it is larger than the sum of its proper divisors (111024242290).
222043423142 is a wasteful number, since it uses less digits than its factorization.
222043423142 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 843574.
The product of its (nonzero) digits is 18432, while the sum is 29.
Adding to 222043423142 its reverse (241324340222), we get a palindrome (463367763364).
The spelling of 222043423142 in words is "two hundred twenty-two billion, forty-three million, four hundred twenty-three thousand, one hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •