Base | Representation |
---|---|
bin | 1011000001000000110000… |
… | …1111011000010100110111 |
3 | 1120212220020000112211122010 |
4 | 2300100030033120110313 |
5 | 3041420400330224421 |
6 | 41432103152135303 |
7 | 2360030655643503 |
oct | 260201417302467 |
9 | 46786200484563 |
10 | 12112013133111 |
11 | 394a748721691 |
12 | 1437480837533 |
13 | 69b208cb17c8 |
14 | 2dc3202b9303 |
15 | 1600dbb22076 |
hex | b040c3d8537 |
12112013133111 has 8 divisors (see below), whose sum is σ = 16851496533120. Its totient is φ = 7723602577592.
The previous prime is 12112013133109. The next prime is 12112013133119. The reversal of 12112013133111 is 11133131021121.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 12112013133111 - 21 = 12112013133109 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12112013133119) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 87768211041 + ... + 87768211178.
It is an arithmetic number, because the mean of its divisors is an integer number (2106437066640).
Almost surely, 212112013133111 is an apocalyptic number.
12112013133111 is a deficient number, since it is larger than the sum of its proper divisors (4739483400009).
12112013133111 is a wasteful number, since it uses less digits than its factorization.
12112013133111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 175536422245.
The product of its (nonzero) digits is 108, while the sum is 21.
Adding to 12112013133111 its reverse (11133131021121), we get a palindrome (23245144154232).
The spelling of 12112013133111 in words is "twelve trillion, one hundred twelve billion, thirteen million, one hundred thirty-three thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •