Base | Representation |
---|---|
bin | 1011000110010100100010… |
… | …1011000000110111000011 |
3 | 1121012121122110211221222122 |
4 | 2301211020223000313003 |
5 | 3044414144124320303 |
6 | 41542025452154455 |
7 | 2366440125526241 |
oct | 261451053006703 |
9 | 47177573757878 |
10 | 12203221323203 |
11 | 39853a2332889 |
12 | 1451096168a2b |
13 | 6a69b3205061 |
14 | 3028d3839791 |
15 | 1626790a5e38 |
hex | b1948ac0dc3 |
12203221323203 has 16 divisors (see below), whose sum is σ = 12616593874944. Its totient is φ = 11794253378400.
The previous prime is 12203221323187. The next prime is 12203221323221. The reversal of 12203221323203 is 30232312230221.
It is a cyclic number.
It is not a de Polignac number, because 12203221323203 - 24 = 12203221323187 is a prime.
It is a super-2 number, since 2×122032213232032 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12203221323233) 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 15 ways as a sum of consecutive naturals, for example, 205387526 + ... + 205446932.
It is an arithmetic number, because the mean of its divisors is an integer number (788537117184).
Almost surely, 212203221323203 is an apocalyptic number.
12203221323203 is a deficient number, since it is larger than the sum of its proper divisors (413372551741).
12203221323203 is a wasteful number, since it uses less digits than its factorization.
12203221323203 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 96362.
The product of its (nonzero) digits is 5184, while the sum is 26.
Adding to 12203221323203 its reverse (30232312230221), we get a palindrome (42435533553424).
The spelling of 12203221323203 in words is "twelve trillion, two hundred three billion, two hundred twenty-one million, three hundred twenty-three thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •