Base | Representation |
---|---|
bin | 10110100011110111… |
… | …01001111101111101 |
3 | 1011021002212220201221 |
4 | 23101323221331331 |
5 | 144301133324013 |
6 | 5321510233341 |
7 | 606101252545 |
oct | 132173517575 |
9 | 34232786657 |
10 | 12112011133 |
11 | 5155a07262 |
12 | 2420355851 |
13 | 11b04223c1 |
14 | 82c858325 |
15 | 4ad4e908d |
hex | 2d1ee9f7d |
12112011133 has 4 divisors (see below), whose sum is σ = 12112262748. Its totient is φ = 12111759520.
The previous prime is 12112011089. The next prime is 12112011137. The reversal of 12112011133 is 33111021121.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 5291398564 + 6820612569 = 72742^2 + 82587^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12112011133 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 (12112011137) 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, 28528 + ... + 158233.
It is an arithmetic number, because the mean of its divisors is an integer number (3028065687).
Almost surely, 212112011133 is an apocalyptic number.
It is an amenable number.
12112011133 is a deficient number, since it is larger than the sum of its proper divisors (251615).
12112011133 is an equidigital number, since it uses as much as digits as its factorization.
12112011133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 251614.
The product of its (nonzero) digits is 36, while the sum is 16.
Adding to 12112011133 its reverse (33111021121), we get a palindrome (45223032254).
The spelling of 12112011133 in words is "twelve billion, one hundred twelve million, eleven thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •