Base | Representation |
---|---|
bin | 1011000110010100100100… |
… | …1101010011011010101111 |
3 | 1121012121200002202122110011 |
4 | 2301211021031103122233 |
5 | 3044414203424441421 |
6 | 41542030412554051 |
7 | 2366440265115046 |
oct | 261451115233257 |
9 | 47177602678404 |
10 | 12203230312111 |
11 | 39853a7412333 |
12 | 1451099182927 |
13 | 6a69b5031637 |
14 | 3028d4ad955d |
15 | 162679c7e4e1 |
hex | b19493536af |
12203230312111 has 8 divisors (see below), whose sum is σ = 13054274271360. Its totient is φ = 11366987117568.
The previous prime is 12203230312079. The next prime is 12203230312123. The reversal of 12203230312111 is 11121303230221.
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 12203230312111 - 25 = 12203230312079 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12203230312171) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3700189471 + ... + 3700192768.
It is an arithmetic number, because the mean of its divisors is an integer number (1631784283920).
Almost surely, 212203230312111 is an apocalyptic number.
12203230312111 is a deficient number, since it is larger than the sum of its proper divisors (851043959249).
12203230312111 is an equidigital number, since it uses as much as digits as its factorization.
12203230312111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7400382353.
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 12203230312111 its reverse (11121303230221), we get a palindrome (23324533542332).
The spelling of 12203230312111 in words is "twelve trillion, two hundred three billion, two hundred thirty million, three hundred twelve thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •