Base | Representation |
---|---|
bin | 10100101001010000… |
… | …10101010111110101 |
3 | 1001121102121221220012 |
4 | 22110220111113311 |
5 | 140144341121421 |
6 | 5031450350005 |
7 | 541442333426 |
oct | 122450252765 |
9 | 31542557805 |
10 | 11083535861 |
11 | 47784045a2 |
12 | 2193a2b305 |
13 | 1078325258 |
14 | 77201764d |
15 | 44d09095b |
hex | 294a155f5 |
11083535861 has 2 divisors, whose sum is σ = 11083535862. Its totient is φ = 11083535860.
The previous prime is 11083535857. The next prime is 11083535893. The reversal of 11083535861 is 16853538011.
11083535861 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 can be written as a sum of positive squares in only one way, i.e., 7414932100 + 3668603761 = 86110^2 + 60569^2 .
It is a cyclic number.
It is not a de Polignac number, because 11083535861 - 22 = 11083535857 is a prime.
It is a super-2 number, since 2×110835358612 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11083535831) 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, 5541767930 + 5541767931.
It is an arithmetic number, because the mean of its divisors is an integer number (5541767931).
Almost surely, 211083535861 is an apocalyptic number.
It is an amenable number.
11083535861 is a deficient number, since it is larger than the sum of its proper divisors (1).
11083535861 is an equidigital number, since it uses as much as digits as its factorization.
11083535861 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 86400, while the sum is 41.
The spelling of 11083535861 in words is "eleven billion, eighty-three million, five hundred thirty-five thousand, eight hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •