Base | Representation |
---|---|
bin | 1010000000111000010001… |
… | …0000010010000011111001 |
3 | 1102222120022011110112011202 |
4 | 2200032010100102003321 |
5 | 2420342412312243231 |
6 | 35230005242303545 |
7 | 2214314342120516 |
oct | 240160420220371 |
9 | 42876264415152 |
10 | 11010220040441 |
11 | 35654541a4626 |
12 | 1299a304b7bb5 |
13 | 61b34a89446b |
14 | 2a0c7ca1630d |
15 | 141603a2e5cb |
hex | a03844120f9 |
11010220040441 has 2 divisors, whose sum is σ = 11010220040442. Its totient is φ = 11010220040440.
The previous prime is 11010220040389. The next prime is 11010220040447. The reversal of 11010220040441 is 14404002201011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9364695512041 + 1645524528400 = 3060179^2 + 1282780^2 .
It is a cyclic number.
It is not a de Polignac number, because 11010220040441 - 210 = 11010220039417 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (11010220040447) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5505110020220 + 5505110020221.
It is an arithmetic number, because the mean of its divisors is an integer number (5505110020221).
Almost surely, 211010220040441 is an apocalyptic number.
It is an amenable number.
11010220040441 is a deficient number, since it is larger than the sum of its proper divisors (1).
11010220040441 is an equidigital number, since it uses as much as digits as its factorization.
11010220040441 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 256, while the sum is 20.
Adding to 11010220040441 its reverse (14404002201011), we get a palindrome (25414222241452).
The spelling of 11010220040441 in words is "eleven trillion, ten billion, two hundred twenty million, forty thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •