Base | Representation |
---|---|
bin | 1010001011111011010000… |
… | …0101101001011110001001 |
3 | 1110122201011100001021100101 |
4 | 2202332310011221132021 |
5 | 2432000100241321022 |
6 | 35453113125405401 |
7 | 2234113316514124 |
oct | 242766405513611 |
9 | 43581140037311 |
10 | 11200001120137 |
11 | 3628991715745 |
12 | 130a775869861 |
13 | 633203a4601b |
14 | 2aa1238693bb |
15 | 14650eca0627 |
hex | a2fb4169789 |
11200001120137 has 2 divisors, whose sum is σ = 11200001120138. Its totient is φ = 11200001120136.
The previous prime is 11200001120111. The next prime is 11200001120177. The reversal of 11200001120137 is 73102110000211.
11200001120137 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10840398210576 + 359602909561 = 3292476^2 + 599669^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11200001120137 is a prime.
It is not a weakly prime, because it can be changed into another prime (11200001120177) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5600000560068 + 5600000560069.
It is an arithmetic number, because the mean of its divisors is an integer number (5600000560069).
Almost surely, 211200001120137 is an apocalyptic number.
It is an amenable number.
11200001120137 is a deficient number, since it is larger than the sum of its proper divisors (1).
11200001120137 is an equidigital number, since it uses as much as digits as its factorization.
11200001120137 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 84, while the sum is 19.
Adding to 11200001120137 its reverse (73102110000211), we get a palindrome (84302111120348).
The spelling of 11200001120137 in words is "eleven trillion, two hundred billion, one million, one hundred twenty thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •