Base | Representation |
---|---|
bin | 10100100011001001… |
… | …00000100001110011 |
3 | 1001110212000220011022 |
4 | 22101210200201303 |
5 | 140043220420311 |
6 | 5022414210055 |
7 | 540250110164 |
oct | 122144404163 |
9 | 31425026138 |
10 | 11032201331 |
11 | 4751432168 |
12 | 217a7b392b |
13 | 106a7c05a8 |
14 | 76929376b |
15 | 4488005db |
hex | 291920873 |
11032201331 has 2 divisors, whose sum is σ = 11032201332. Its totient is φ = 11032201330.
The previous prime is 11032201319. The next prime is 11032201337. The reversal of 11032201331 is 13310223011.
It is a strong prime.
It is an emirp because it is prime and its reverse (13310223011) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11032201331 - 210 = 11032200307 is a prime.
It is a super-2 number, since 2×110322013312 (a number of 21 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (11032201337) 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, 5516100665 + 5516100666.
It is an arithmetic number, because the mean of its divisors is an integer number (5516100666).
Almost surely, 211032201331 is an apocalyptic number.
11032201331 is a deficient number, since it is larger than the sum of its proper divisors (1).
11032201331 is an equidigital number, since it uses as much as digits as its factorization.
11032201331 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 11032201331 its reverse (13310223011), we get a palindrome (24342424342).
The spelling of 11032201331 in words is "eleven billion, thirty-two million, two hundred one thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •