Base | Representation |
---|---|
bin | 1011000010001110111111… |
… | …1011111100100111011111 |
3 | 1120221220102112201100211120 |
4 | 2300203233323330213133 |
5 | 3042241402324111221 |
6 | 41445455042422023 |
7 | 2361403242556536 |
oct | 260435773744737 |
9 | 46856375640746 |
10 | 12133013113311 |
11 | 3958644660622 |
12 | 143b561661913 |
13 | 6a01a48ba5ac |
14 | 2dd35330531d |
15 | 16091a5685c6 |
hex | b08efefc9df |
12133013113311 has 4 divisors (see below), whose sum is σ = 16177350817752. Its totient is φ = 8088675408872.
The previous prime is 12133013113231. The next prime is 12133013113313. The reversal of 12133013113311 is 11331131033121.
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 12133013113311 - 27 = 12133013113183 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12133013113313) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2022168852216 + ... + 2022168852221.
It is an arithmetic number, because the mean of its divisors is an integer number (4044337704438).
Almost surely, 212133013113311 is an apocalyptic number.
12133013113311 is a deficient number, since it is larger than the sum of its proper divisors (4044337704441).
12133013113311 is an equidigital number, since it uses as much as digits as its factorization.
12133013113311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4044337704440.
The product of its (nonzero) digits is 486, while the sum is 24.
Adding to 12133013113311 its reverse (11331131033121), we get a palindrome (23464144146432).
The spelling of 12133013113311 in words is "twelve trillion, one hundred thirty-three billion, thirteen million, one hundred thirteen thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •