Base | Representation |
---|---|
bin | 1011000110010001001111… |
… | …0011000100100111101111 |
3 | 1121012112100122122122010211 |
4 | 2301210103303010213233 |
5 | 3044410340031241221 |
6 | 41541401443043251 |
7 | 2366406134501422 |
oct | 261442363044757 |
9 | 47175318578124 |
10 | 12202334243311 |
11 | 3984a87625603 |
12 | 1450a89070527 |
13 | 6a68a14b3404 |
14 | 30284bac39b9 |
15 | 16262627c6e1 |
hex | b1913cc49ef |
12202334243311 has 8 divisors (see below), whose sum is σ = 13020515271920. Its totient is φ = 11401748505792.
The previous prime is 12202334243303. The next prime is 12202334243381. The reversal of 12202334243311 is 11334243320221.
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 12202334243311 - 23 = 12202334243303 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 (12202334243381) 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, 4398821340 + ... + 4398824113.
It is an arithmetic number, because the mean of its divisors is an integer number (1627564408990).
Almost surely, 212202334243311 is an apocalyptic number.
12202334243311 is a deficient number, since it is larger than the sum of its proper divisors (818181028609).
12202334243311 is an equidigital number, since it uses as much as digits as its factorization.
12202334243311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8797645545.
The product of its (nonzero) digits is 20736, while the sum is 31.
Adding to 12202334243311 its reverse (11334243320221), we get a palindrome (23536577563532).
The spelling of 12202334243311 in words is "twelve trillion, two hundred two billion, three hundred thirty-four million, two hundred forty-three thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •