Base | Representation |
---|---|
bin | 1011001000000011100110… |
… | …0010001011101111011111 |
3 | 1121022110121001010102011021 |
4 | 2302000321202023233133 |
5 | 3100411222210340221 |
6 | 42003435525105011 |
7 | 2401543640243131 |
oct | 262007142135737 |
9 | 47273531112137 |
10 | 12233032121311 |
11 | 3996aaa799711 |
12 | 1456a15858167 |
13 | 6a9754323a71 |
14 | 304120ab3051 |
15 | 1633212aa041 |
hex | b203988bbdf |
12233032121311 has 4 divisors (see below), whose sum is σ = 12952622246112. Its totient is φ = 11513441996512.
The previous prime is 12233032121291. The next prime is 12233032121327. The reversal of 12233032121311 is 11312123033221.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 12233032121311 - 229 = 12232495250399 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 (12233032121351) 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 3 ways as a sum of consecutive naturals, for example, 359795062375 + ... + 359795062408.
It is an arithmetic number, because the mean of its divisors is an integer number (3238155561528).
Almost surely, 212233032121311 is an apocalyptic number.
12233032121311 is a deficient number, since it is larger than the sum of its proper divisors (719590124801).
12233032121311 is an equidigital number, since it uses as much as digits as its factorization.
12233032121311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 719590124800.
The product of its (nonzero) digits is 1296, while the sum is 25.
Adding to 12233032121311 its reverse (11312123033221), we get a palindrome (23545155154532).
The spelling of 12233032121311 in words is "twelve trillion, two hundred thirty-three billion, thirty-two million, one hundred twenty-one thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •