Base | Representation |
---|---|
bin | 110011101100010110… |
… | …1111011001110101001 |
3 | 101121112111002101021021 |
4 | 1213120231323032221 |
5 | 3304322041201022 |
6 | 122555231412441 |
7 | 11006635165546 |
oct | 1473055731651 |
9 | 347474071237 |
10 | 111010100137 |
11 | 43096342312 |
12 | 19621084121 |
13 | a6118623b1 |
14 | 55313ddbcd |
15 | 2d4ab217c7 |
hex | 19d8b7b3a9 |
111010100137 has 2 divisors, whose sum is σ = 111010100138. Its totient is φ = 111010100136.
The previous prime is 111010100107. The next prime is 111010100143. The reversal of 111010100137 is 731001010111.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 110340894976 + 669205161 = 332176^2 + 25869^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-111010100137 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 111010100137.
It is not a weakly prime, because it can be changed into another prime (111010100107) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55505050068 + 55505050069.
It is an arithmetic number, because the mean of its divisors is an integer number (55505050069).
Almost surely, 2111010100137 is an apocalyptic number.
It is an amenable number.
111010100137 is a deficient number, since it is larger than the sum of its proper divisors (1).
111010100137 is an equidigital number, since it uses as much as digits as its factorization.
111010100137 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 21, while the sum is 16.
Adding to 111010100137 its reverse (731001010111), we get a palindrome (842011110248).
The spelling of 111010100137 in words is "one hundred eleven billion, ten million, one hundred thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •