Base | Representation |
---|---|
bin | 11001000000110111101110… |
… | …100100111011100110000001 |
3 | 112102111221121202000020121222 |
4 | 121000313232210323212001 |
5 | 103404410012000324022 |
6 | 1025550204500124425 |
7 | 32113014064210061 |
oct | 3100675644734601 |
9 | 472457552006558 |
10 | 110011000011137 |
11 | 32064448586395 |
12 | 10408a51396715 |
13 | 494ccba200ba4 |
14 | 1d247bcc153a1 |
15 | cab98a2a5242 |
hex | 640dee93b981 |
110011000011137 has 2 divisors, whose sum is σ = 110011000011138. Its totient is φ = 110011000011136.
The previous prime is 110011000011091. The next prime is 110011000011151. The reversal of 110011000011137 is 731110000110011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 98900717773456 + 11110282237681 = 9944884^2 + 3333209^2 .
It is a cyclic number.
It is not a de Polignac number, because 110011000011137 - 210 = 110011000010113 is a prime.
It is not a weakly prime, because it can be changed into another prime (110011000011167) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55005500005568 + 55005500005569.
It is an arithmetic number, because the mean of its divisors is an integer number (55005500005569).
Almost surely, 2110011000011137 is an apocalyptic number.
It is an amenable number.
110011000011137 is a deficient number, since it is larger than the sum of its proper divisors (1).
110011000011137 is an equidigital number, since it uses as much as digits as its factorization.
110011000011137 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 21, while the sum is 17.
Adding to 110011000011137 its reverse (731110000110011), we get a palindrome (841121000121148).
The spelling of 110011000011137 in words is "one hundred ten trillion, eleven billion, eleven thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.354 sec. • engine limits •