Base | Representation |
---|---|
bin | 10100100011000000… |
… | …10110001010000001 |
3 | 1001110202222110111202 |
4 | 22101200112022001 |
5 | 140042431012043 |
6 | 5022334550545 |
7 | 540234614231 |
oct | 122140261201 |
9 | 31422873452 |
10 | 11031110273 |
11 | 4750857467 |
12 | 217a368455 |
13 | 106a4caab1 |
14 | 76908bcc1 |
15 | 4486871b8 |
hex | 291816281 |
11031110273 has 2 divisors, whose sum is σ = 11031110274. Its totient is φ = 11031110272.
The previous prime is 11031110267. The next prime is 11031110281. The reversal of 11031110273 is 37201113011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10108894849 + 922215424 = 100543^2 + 30368^2 .
It is an emirp because it is prime and its reverse (37201113011) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11031110273 - 210 = 11031109249 is a prime.
It is a super-2 number, since 2×110311102732 (a number of 21 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (11031113273) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5515555136 + 5515555137.
It is an arithmetic number, because the mean of its divisors is an integer number (5515555137).
Almost surely, 211031110273 is an apocalyptic number.
It is an amenable number.
11031110273 is a deficient number, since it is larger than the sum of its proper divisors (1).
11031110273 is an equidigital number, since it uses as much as digits as its factorization.
11031110273 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 126, while the sum is 20.
Adding to 11031110273 its reverse (37201113011), we get a palindrome (48232223284).
The spelling of 11031110273 in words is "eleven billion, thirty-one million, one hundred ten thousand, two hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •