Base | Representation |
---|---|
bin | 110011110010000001… |
… | …1001001110001110101 |
3 | 101122000201211011122101 |
4 | 1213210003021301311 |
5 | 3310214223323013 |
6 | 123030142302101 |
7 | 11014434140011 |
oct | 1474403116165 |
9 | 348021734571 |
10 | 111200214133 |
11 | 43183692818 |
12 | 19674887931 |
13 | a642067998 |
14 | 554c76b541 |
15 | 2d5c6768dd |
hex | 19e40c9c75 |
111200214133 has 2 divisors, whose sum is σ = 111200214134. Its totient is φ = 111200214132.
The previous prime is 111200214127. The next prime is 111200214149. The reversal of 111200214133 is 331412002111.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 93142767249 + 18057446884 = 305193^2 + 134378^2 .
It is a cyclic number.
It is not a de Polignac number, because 111200214133 - 217 = 111200083061 is a prime.
It is a super-3 number, since 3×1112002141333 (a number of 34 digits) contains 333 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 111200214133.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (111200218133) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55600107066 + 55600107067.
It is an arithmetic number, because the mean of its divisors is an integer number (55600107067).
Almost surely, 2111200214133 is an apocalyptic number.
It is an amenable number.
111200214133 is a deficient number, since it is larger than the sum of its proper divisors (1).
111200214133 is an equidigital number, since it uses as much as digits as its factorization.
111200214133 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 111200214133 its reverse (331412002111), we get a palindrome (442612216244).
The spelling of 111200214133 in words is "one hundred eleven billion, two hundred million, two hundred fourteen thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •