Base | Representation |
---|---|
bin | 10100100001110110… |
… | …00010110001110001 |
3 | 1001110002120122122112 |
4 | 22100323002301301 |
5 | 140032430102234 |
6 | 5021345215105 |
7 | 540055526003 |
oct | 122073026161 |
9 | 31402518575 |
10 | 11021331569 |
11 | 4746288596 |
12 | 2177031495 |
13 | 1068485b91 |
14 | 767a64373 |
15 | 4478a4ace |
hex | 290ec2c71 |
11021331569 has 2 divisors, whose sum is σ = 11021331570. Its totient is φ = 11021331568.
The previous prime is 11021331487. The next prime is 11021331583. The reversal of 11021331569 is 96513312011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8266446400 + 2754885169 = 90920^2 + 52487^2 .
It is a cyclic number.
It is not a de Polignac number, because 11021331569 - 216 = 11021266033 is a prime.
It is a super-2 number, since 2×110213315692 (a number of 21 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (11021336569) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5510665784 + 5510665785.
It is an arithmetic number, because the mean of its divisors is an integer number (5510665785).
Almost surely, 211021331569 is an apocalyptic number.
It is an amenable number.
11021331569 is a deficient number, since it is larger than the sum of its proper divisors (1).
11021331569 is an equidigital number, since it uses as much as digits as its factorization.
11021331569 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4860, while the sum is 32.
The spelling of 11021331569 in words is "eleven billion, twenty-one million, three hundred thirty-one thousand, five hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •