Base | Representation |
---|---|
bin | 1011000001000001001101… |
… | …0001000000101100101101 |
3 | 1120212220112020100011011102 |
4 | 2300100103101000230231 |
5 | 3041421121014014013 |
6 | 41432123002332445 |
7 | 2360033616545162 |
oct | 260202321005455 |
9 | 46786466304142 |
10 | 12112131001133 |
11 | 394a7a9207679 |
12 | 14374b41ba125 |
13 | 69b2275401b7 |
14 | 2dc331bdc069 |
15 | 1600e7155d58 |
hex | b0413440b2d |
12112131001133 has 4 divisors (see below), whose sum is σ = 12749611580160. Its totient is φ = 11474650422108.
The previous prime is 12112131001093. The next prime is 12112131001163. The reversal of 12112131001133 is 33110013121121.
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.
It is a cyclic number.
It is not a de Polignac number, because 12112131001133 - 218 = 12112130738989 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 (12112131001163) 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, 318740289485 + ... + 318740289522.
It is an arithmetic number, because the mean of its divisors is an integer number (3187402895040).
Almost surely, 212112131001133 is an apocalyptic number.
It is an amenable number.
12112131001133 is a deficient number, since it is larger than the sum of its proper divisors (637480579027).
12112131001133 is an equidigital number, since it uses as much as digits as its factorization.
12112131001133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 637480579026.
The product of its (nonzero) digits is 108, while the sum is 20.
Adding to 12112131001133 its reverse (33110013121121), we get a palindrome (45222144122254).
The spelling of 12112131001133 in words is "twelve trillion, one hundred twelve billion, one hundred thirty-one million, one thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •