Base | Representation |
---|---|
bin | 10100100000100010… |
… | …00101000111110001 |
3 | 1001102022212202212112 |
4 | 22100101011013301 |
5 | 140022121043441 |
6 | 5020313335105 |
7 | 536563161506 |
oct | 122021050761 |
9 | 31368782775 |
10 | 11010331121 |
11 | 4740054809 |
12 | 2173407495 |
13 | 1066103b3a |
14 | 7663dd4ad |
15 | 4469304eb |
hex | 2904451f1 |
11010331121 has 2 divisors, whose sum is σ = 11010331122. Its totient is φ = 11010331120.
The previous prime is 11010331097. The next prime is 11010331133. The reversal of 11010331121 is 12113301011.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6916250896 + 4094080225 = 83164^2 + 63985^2 .
It is a cyclic number.
It is not a de Polignac number, because 11010331121 - 230 = 9936589297 is a prime.
It is a super-2 number, since 2×110103311212 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11010331096 and 11010331105.
It is not a weakly prime, because it can be changed into another prime (11010331181) 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, 5505165560 + 5505165561.
It is an arithmetic number, because the mean of its divisors is an integer number (5505165561).
Almost surely, 211010331121 is an apocalyptic number.
It is an amenable number.
11010331121 is a deficient number, since it is larger than the sum of its proper divisors (1).
11010331121 is an equidigital number, since it uses as much as digits as its factorization.
11010331121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 18, while the sum is 14.
Adding to 11010331121 its reverse (12113301011), we get a palindrome (23123632132).
The spelling of 11010331121 in words is "eleven billion, ten million, three hundred thirty-one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •