Base | Representation |
---|---|
bin | 10100110001001100… |
… | …10110111001000001 |
3 | 1001210001221010021222 |
4 | 22120212112321001 |
5 | 140313413023112 |
6 | 5042225524425 |
7 | 543211340615 |
oct | 123046267101 |
9 | 31701833258 |
10 | 11150126657 |
11 | 4801a5720a |
12 | 21b21a3715 |
13 | 108906c0a7 |
14 | 77abcd345 |
15 | 453d46372 |
hex | 298996e41 |
11150126657 has 2 divisors, whose sum is σ = 11150126658. Its totient is φ = 11150126656.
The previous prime is 11150126641. The next prime is 11150126677. The reversal of 11150126657 is 75662105111.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 6298168321 + 4851958336 = 79361^2 + 69656^2 .
It is an emirp because it is prime and its reverse (75662105111) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11150126657 - 24 = 11150126641 is a prime.
It is not a weakly prime, because it can be changed into another prime (11150126677) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5575063328 + 5575063329.
It is an arithmetic number, because the mean of its divisors is an integer number (5575063329).
Almost surely, 211150126657 is an apocalyptic number.
It is an amenable number.
11150126657 is a deficient number, since it is larger than the sum of its proper divisors (1).
11150126657 is an equidigital number, since it uses as much as digits as its factorization.
11150126657 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12600, while the sum is 35.
The spelling of 11150126657 in words is "eleven billion, one hundred fifty million, one hundred twenty-six thousand, six hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •