Base | Representation |
---|---|
bin | 101110001101… |
… | …000100000101 |
3 | 211210100201112 |
4 | 232031010011 |
5 | 11100042013 |
6 | 1111334405 |
7 | 204644225 |
oct | 56150405 |
9 | 24710645 |
10 | 12112133 |
11 | 6923030 |
12 | 4081405 |
13 | 2681057 |
14 | 1874085 |
15 | 10e3ba8 |
hex | b8d105 |
12112133 has 4 divisors (see below), whose sum is σ = 13213248. Its totient is φ = 11011020.
The previous prime is 12112127. The next prime is 12112159. The reversal of 12112133 is 33121121.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 33121121 = 11 ⋅3011011.
It is a cyclic number.
It is not a de Polignac number, because 12112133 - 26 = 12112069 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 (12112183) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 550541 + ... + 550562.
It is an arithmetic number, because the mean of its divisors is an integer number (3303312).
Almost surely, 212112133 is an apocalyptic number.
It is an amenable number.
12112133 is a deficient number, since it is larger than the sum of its proper divisors (1101115).
12112133 is a wasteful number, since it uses less digits than its factorization.
12112133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1101114.
The product of its digits is 36, while the sum is 14.
The square root of 12112133 is about 3480.2489853457. The cubic root of 12112133 is about 229.6537512202.
Adding to 12112133 its reverse (33121121), we get a palindrome (45233254).
It can be divided in two parts, 121121 and 33, that multiplied together give a palindrome (3996993).
The spelling of 12112133 in words is "twelve million, one hundred twelve thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •