Base | Representation |
---|---|
bin | 10110110011100000… |
… | …01100011010011110 |
3 | 1011121020210020020222 |
4 | 23121300030122132 |
5 | 200033231133342 |
6 | 5342514441342 |
7 | 612253455155 |
oct | 133160143236 |
9 | 34536706228 |
10 | 12243224222 |
11 | 5212a87629 |
12 | 2458293252 |
13 | 1201674098 |
14 | 84205259c |
15 | 4b9cb6ed2 |
hex | 2d9c0c69e |
12243224222 has 8 divisors (see below), whose sum is σ = 18533321400. Its totient is φ = 6065450424.
The previous prime is 12243224183. The next prime is 12243224281. The reversal of 12243224222 is 22242234221.
It is a happy number.
12243224222 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 junction number, because it is equal to n+sod(n) for n = 12243224191 and 12243224200.
It is a congruent number.
It is an unprimeable number.
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, 28080572 + ... + 28081007.
It is an arithmetic number, because the mean of its divisors is an integer number (2316665175).
Almost surely, 212243224222 is an apocalyptic number.
12243224222 is a deficient number, since it is larger than the sum of its proper divisors (6290097178).
12243224222 is a wasteful number, since it uses less digits than its factorization.
12243224222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 56161690.
The product of its digits is 6144, while the sum is 26.
Adding to 12243224222 its reverse (22242234221), we get a palindrome (34485458443).
Subtracting 12243224222 from its reverse (22242234221), we obtain a palindrome (9999009999).
The spelling of 12243224222 in words is "twelve billion, two hundred forty-three million, two hundred twenty-four thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •