Base | Representation |
---|---|
bin | 10100100000101000… |
… | …00011100101101001 |
3 | 1001102101100102001001 |
4 | 22100110003211221 |
5 | 140022321030043 |
6 | 5020342155001 |
7 | 536602621141 |
oct | 122024034551 |
9 | 31371312031 |
10 | 11011111273 |
11 | 4740537968 |
12 | 2173722a61 |
13 | 1066317c76 |
14 | 766563921 |
15 | 446a3674d |
hex | 290503969 |
11011111273 has 2 divisors, whose sum is σ = 11011111274. Its totient is φ = 11011111272.
The previous prime is 11011111271. The next prime is 11011111303. The reversal of 11011111273 is 37211111011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 8943863184 + 2067248089 = 94572^2 + 45467^2 .
It is a cyclic number.
It is not a de Polignac number, because 11011111273 - 21 = 11011111271 is a prime.
Together with 11011111271, it forms a pair of twin primes.
It is a self number, because there is not a number n which added to its sum of digits gives 11011111273.
It is not a weakly prime, because it can be changed into another prime (11011111271) 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, 5505555636 + 5505555637.
It is an arithmetic number, because the mean of its divisors is an integer number (5505555637).
Almost surely, 211011111273 is an apocalyptic number.
It is an amenable number.
11011111273 is a deficient number, since it is larger than the sum of its proper divisors (1).
11011111273 is an equidigital number, since it uses as much as digits as its factorization.
11011111273 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 42, while the sum is 19.
Adding to 11011111273 its reverse (37211111011), we get a palindrome (48222222284).
The spelling of 11011111273 in words is "eleven billion, eleven million, one hundred eleven thousand, two hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •