Base | Representation |
---|---|
bin | 1011000110010100100010… |
… | …1101101011110000101110 |
3 | 1121012121122112011112012222 |
4 | 2301211020231223300232 |
5 | 3044414144314220324 |
6 | 41542025515155342 |
7 | 2366440134503135 |
oct | 261451055536056 |
9 | 47177575145188 |
10 | 12203222023214 |
11 | 39853a2770802 |
12 | 1451096445b52 |
13 | 6a69b33bb871 |
14 | 3028d397c91c |
15 | 16267919355e |
hex | b1948b6bc2e |
12203222023214 has 8 divisors (see below), whose sum is σ = 18311391564528. Its totient is φ = 6099424835040.
The previous prime is 12203222023189. The next prime is 12203222023219. The reversal of 12203222023214 is 41232022230221.
12203222023214 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-3 number, since 3×122032220232143 (a number of 40 digits) contains 333 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12203222023219) 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, 1093081307 + ... + 1093092470.
It is an arithmetic number, because the mean of its divisors is an integer number (2288923945566).
Almost surely, 212203222023214 is an apocalyptic number.
12203222023214 is a deficient number, since it is larger than the sum of its proper divisors (6108169541314).
12203222023214 is a wasteful number, since it uses less digits than its factorization.
12203222023214 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2186176570.
The product of its (nonzero) digits is 4608, while the sum is 26.
Adding to 12203222023214 its reverse (41232022230221), we get a palindrome (53435244253435).
The spelling of 12203222023214 in words is "twelve trillion, two hundred three billion, two hundred twenty-two million, twenty-three thousand, two hundred fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •