Base | Representation |
---|---|
bin | 10101001010111110… |
… | …00100110100100011 |
3 | 1002100010201221210021 |
4 | 22211133010310203 |
5 | 141234234241233 |
6 | 5115511414311 |
7 | 551445065251 |
oct | 124537046443 |
9 | 32303657707 |
10 | 11366321443 |
11 | 4902aa0594 |
12 | 2252684397 |
13 | 10c1aa67b9 |
14 | 79b7c95d1 |
15 | 467cede2d |
hex | 2a57c4d23 |
11366321443 has 2 divisors, whose sum is σ = 11366321444. Its totient is φ = 11366321442.
The previous prime is 11366321429. The next prime is 11366321459. The reversal of 11366321443 is 34412366311.
11366321443 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 11366321443 - 213 = 11366313251 is a prime.
It is a super-3 number, since 3×113663214433 (a number of 31 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11366321399 and 11366321408.
It is not a weakly prime, because it can be changed into another prime (11366321413) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5683160721 + 5683160722.
It is an arithmetic number, because the mean of its divisors is an integer number (5683160722).
Almost surely, 211366321443 is an apocalyptic number.
11366321443 is a deficient number, since it is larger than the sum of its proper divisors (1).
11366321443 is an equidigital number, since it uses as much as digits as its factorization.
11366321443 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 31104, while the sum is 34.
Adding to 11366321443 its reverse (34412366311), we get a palindrome (45778687754).
The spelling of 11366321443 in words is "eleven billion, three hundred sixty-six million, three hundred twenty-one thousand, four hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •