Base | Representation |
---|---|
bin | 1010000010000110000101… |
… | …1010000000011000010001 |
3 | 1110001120020001000202211212 |
4 | 2200201201122000120101 |
5 | 2421213203204122002 |
6 | 35243342211345505 |
7 | 2215654123545116 |
oct | 240414132003021 |
9 | 43046201022755 |
10 | 11031110223377 |
11 | 35732a4160222 |
12 | 12a1aa05b2295 |
13 | 6202c980925a |
14 | 2a1ca122090d |
15 | 141e279d8352 |
hex | a0861680611 |
11031110223377 has 2 divisors, whose sum is σ = 11031110223378. Its totient is φ = 11031110223376.
The previous prime is 11031110223311. The next prime is 11031110223391. The reversal of 11031110223377 is 77332201113011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11013132508816 + 17977714561 = 3318604^2 + 134081^2 .
It is a cyclic number.
It is not a de Polignac number, because 11031110223377 - 28 = 11031110223121 is a prime.
It is not a weakly prime, because it can be changed into another prime (11031110223877) 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, 5515555111688 + 5515555111689.
It is an arithmetic number, because the mean of its divisors is an integer number (5515555111689).
Almost surely, 211031110223377 is an apocalyptic number.
It is an amenable number.
11031110223377 is a deficient number, since it is larger than the sum of its proper divisors (1).
11031110223377 is an equidigital number, since it uses as much as digits as its factorization.
11031110223377 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5292, while the sum is 32.
Adding to 11031110223377 its reverse (77332201113011), we get a palindrome (88363311336388).
The spelling of 11031110223377 in words is "eleven trillion, thirty-one billion, one hundred ten million, two hundred twenty-three thousand, three hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •