Base | Representation |
---|---|
bin | 1010111011001001001111… |
… | …1101111000011010010101 |
3 | 1120112021000221121112210202 |
4 | 2232302103331320122111 |
5 | 3033242430011012323 |
6 | 41313512453230245 |
7 | 2346532002141431 |
oct | 256622375703225 |
9 | 46467027545722 |
10 | 12011211032213 |
11 | 3910a20550288 |
12 | 141ba2a332385 |
13 | 691863264b63 |
14 | 2d74ba9039c1 |
15 | 15c68c297d28 |
hex | aec93f78695 |
12011211032213 has 4 divisors (see below), whose sum is σ = 12047498679168. Its totient is φ = 11974923385260.
The previous prime is 12011211032173. The next prime is 12011211032257. The reversal of 12011211032213 is 31223011211021.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 12011211032213 - 210 = 12011211031189 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12011211032263) 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, 18143822981 + ... + 18143823642.
It is an arithmetic number, because the mean of its divisors is an integer number (3011874669792).
Almost surely, 212011211032213 is an apocalyptic number.
It is an amenable number.
12011211032213 is a deficient number, since it is larger than the sum of its proper divisors (36287646955).
12011211032213 is an equidigital number, since it uses as much as digits as its factorization.
12011211032213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36287646954.
The product of its (nonzero) digits is 144, while the sum is 20.
Adding to 12011211032213 its reverse (31223011211021), we get a palindrome (43234222243234).
The spelling of 12011211032213 in words is "twelve trillion, eleven billion, two hundred eleven million, thirty-two thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •