Base | Representation |
---|---|
bin | 1011000110010011110011… |
… | …0111001111101110000001 |
3 | 1121012121010200001102102210 |
4 | 2301210330313033232001 |
5 | 3044413242420000301 |
6 | 41541554053532333 |
7 | 2366432201532015 |
oct | 261447467175601 |
9 | 47177120042383 |
10 | 12203023203201 |
11 | 3985300514346 |
12 | 145103b9440a9 |
13 | 6a698115869c |
14 | 3028b53c6545 |
15 | 1626669bdad6 |
hex | b193cdcfb81 |
12203023203201 has 8 divisors (see below), whose sum is σ = 16271154750240. Its totient is φ = 8135120229152.
The previous prime is 12203023203113. The next prime is 12203023203209. The reversal of 12203023203201 is 10230232030221.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 12203023203201 - 238 = 11928145296257 is a prime.
It is a super-3 number, since 3×122030232032013 (a number of 40 digits) contains 333 as substring.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (12203023203209) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 57018636 + ... + 57232253.
It is an arithmetic number, because the mean of its divisors is an integer number (2033894343780).
Almost surely, 212203023203201 is an apocalyptic number.
It is an amenable number.
12203023203201 is a deficient number, since it is larger than the sum of its proper divisors (4068131547039).
12203023203201 is a wasteful number, since it uses less digits than its factorization.
12203023203201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 114286495.
The product of its (nonzero) digits is 864, while the sum is 21.
Adding to 12203023203201 its reverse (10230232030221), we get a palindrome (22433255233422).
The spelling of 12203023203201 in words is "twelve trillion, two hundred three billion, twenty-three million, two hundred three thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •