Base | Representation |
---|---|
bin | 10110101110011000… |
… | …01100000100101101 |
3 | 1011111020212221221022 |
4 | 23113030030010231 |
5 | 144441224344323 |
6 | 5334341143525 |
7 | 611222153132 |
oct | 132714140455 |
9 | 34436787838 |
10 | 12200231213 |
11 | 51a0792315 |
12 | 24459baba5 |
13 | 11c57a0131 |
14 | 83a460589 |
15 | 4b61234c8 |
hex | 2d730c12d |
12200231213 has 4 divisors (see below), whose sum is σ = 12206354748. Its totient is φ = 12194107680.
The previous prime is 12200231207. The next prime is 12200231273. The reversal of 12200231213 is 31213200221.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 2968288324 + 9231942889 = 54482^2 + 96083^2 .
It is a cyclic number.
It is not a de Polignac number, because 12200231213 - 220 = 12199182637 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12200231191 and 12200231200.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12200231273) 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, 3058778 + ... + 3062763.
It is an arithmetic number, because the mean of its divisors is an integer number (3051588687).
Almost surely, 212200231213 is an apocalyptic number.
It is an amenable number.
12200231213 is a deficient number, since it is larger than the sum of its proper divisors (6123535).
12200231213 is an equidigital number, since it uses as much as digits as its factorization.
12200231213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6123534.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 12200231213 its reverse (31213200221), we get a palindrome (43413431434).
The spelling of 12200231213 in words is "twelve billion, two hundred million, two hundred thirty-one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •