Base | Representation |
---|---|
bin | 1010111011001001100111… |
… | …1111100011001111110111 |
3 | 1120112021021222212000011110 |
4 | 2232302121333203033313 |
5 | 3033243131401224421 |
6 | 41313530504210103 |
7 | 2346534340400304 |
oct | 256623177431767 |
9 | 46467258760143 |
10 | 12011312133111 |
11 | 3910a72623945 |
12 | 141ba58169933 |
13 | 69187b1a2785 |
14 | 2d74ca1000ab |
15 | 15c6960b8a76 |
hex | aec99fe33f7 |
12011312133111 has 4 divisors (see below), whose sum is σ = 16015082844152. Its totient is φ = 8007541422072.
The previous prime is 12011312133097. The next prime is 12011312133173. The reversal of 12011312133111 is 11133121311021.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 12011312133111 - 210 = 12011312132087 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 (12011312133511) 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, 2001885355516 + ... + 2001885355521.
It is an arithmetic number, because the mean of its divisors is an integer number (4003770711038).
Almost surely, 212011312133111 is an apocalyptic number.
12011312133111 is a deficient number, since it is larger than the sum of its proper divisors (4003770711041).
12011312133111 is an equidigital number, since it uses as much as digits as its factorization.
12011312133111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4003770711040.
The product of its (nonzero) digits is 108, while the sum is 21.
Adding to 12011312133111 its reverse (11133121311021), we get a palindrome (23144433444132).
The spelling of 12011312133111 in words is "twelve trillion, eleven billion, three hundred twelve million, one hundred thirty-three thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •