Base | Representation |
---|---|
bin | 10110100011101111… |
… | …10101100110100101 |
3 | 1011021001000001201211 |
4 | 23101313311212211 |
5 | 144300404311323 |
6 | 5321432551421 |
7 | 606056613451 |
oct | 132167654645 |
9 | 34231001654 |
10 | 12111010213 |
11 | 5155393255 |
12 | 241bb52571 |
13 | 11b0161943 |
14 | 82c677661 |
15 | 4ad39c70d |
hex | 2d1df59a5 |
12111010213 has 4 divisors (see below), whose sum is σ = 12406400748. Its totient is φ = 11815619680.
The previous prime is 12111010201. The next prime is 12111010253. The reversal of 12111010213 is 31201011121.
It is a happy number.
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 172607044 + 11938403169 = 13138^2 + 109263^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12111010213 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12111010193 and 12111010202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12111010253) 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, 147695206 + ... + 147695287.
It is an arithmetic number, because the mean of its divisors is an integer number (3101600187).
Almost surely, 212111010213 is an apocalyptic number.
It is an amenable number.
12111010213 is a deficient number, since it is larger than the sum of its proper divisors (295390535).
12111010213 is an equidigital number, since it uses as much as digits as its factorization.
12111010213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 295390534.
The product of its (nonzero) digits is 12, while the sum is 13.
Adding to 12111010213 its reverse (31201011121), we get a palindrome (43312021334).
The spelling of 12111010213 in words is "twelve billion, one hundred eleven million, ten thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •