Base | Representation |
---|---|
bin | 10100110001010000… |
… | …00001000101110011 |
3 | 1001210002202012222212 |
4 | 22120220001011303 |
5 | 140314020433101 |
6 | 5042243122335 |
7 | 543215132045 |
oct | 123050010563 |
9 | 31702665885 |
10 | 11150561651 |
11 | 4802224009 |
12 | 21b23733ab |
13 | 1089192098 |
14 | 77aca3a95 |
15 | 453dd01bb |
hex | 298a01173 |
11150561651 has 2 divisors, whose sum is σ = 11150561652. Its totient is φ = 11150561650.
The previous prime is 11150561603. The next prime is 11150561663. The reversal of 11150561651 is 15616505111.
It is a strong prime.
It is an emirp because it is prime and its reverse (15616505111) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11150561651 - 214 = 11150545267 is a prime.
It is a Sophie Germain prime.
It is not a weakly prime, because it can be changed into another prime (11156561651) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5575280825 + 5575280826.
It is an arithmetic number, because the mean of its divisors is an integer number (5575280826).
Almost surely, 211150561651 is an apocalyptic number.
11150561651 is a deficient number, since it is larger than the sum of its proper divisors (1).
11150561651 is an equidigital number, since it uses as much as digits as its factorization.
11150561651 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4500, while the sum is 32.
The spelling of 11150561651 in words is "eleven billion, one hundred fifty million, five hundred sixty-one thousand, six hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •