Base | Representation |
---|---|
bin | 1010000011001110000100… |
… | …1000101000001000000101 |
3 | 1110010102002200021120021122 |
4 | 2200303201020220020011 |
5 | 2422022241323123141 |
6 | 35300255430123325 |
7 | 2220240013606304 |
oct | 240634110501005 |
9 | 43112080246248 |
10 | 11050433020421 |
11 | 358050a3a0683 |
12 | 12a57937b0545 |
13 | 622088ac7082 |
14 | 2a2bb55c443b |
15 | 1426a908664b |
hex | a0ce1228205 |
11050433020421 has 2 divisors, whose sum is σ = 11050433020422. Its totient is φ = 11050433020420.
The previous prime is 11050433020357. The next prime is 11050433020511. The reversal of 11050433020421 is 12402033405011.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 11049408124225 + 1024896196 = 3324065^2 + 32014^2 .
It is a cyclic number.
It is not a de Polignac number, because 11050433020421 - 26 = 11050433020357 is a prime.
It is a super-2 number, since 2×110504330204212 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11050433020321) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5525216510210 + 5525216510211.
It is an arithmetic number, because the mean of its divisors is an integer number (5525216510211).
Almost surely, 211050433020421 is an apocalyptic number.
It is an amenable number.
11050433020421 is a deficient number, since it is larger than the sum of its proper divisors (1).
11050433020421 is an equidigital number, since it uses as much as digits as its factorization.
11050433020421 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2880, while the sum is 26.
Adding to 11050433020421 its reverse (12402033405011), we get a palindrome (23452466425432).
The spelling of 11050433020421 in words is "eleven trillion, fifty billion, four hundred thirty-three million, twenty thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •