Base | Representation |
---|---|
bin | 10101000110110001… |
… | …10110000111010101 |
3 | 1002020200112020120021 |
4 | 22203120312013111 |
5 | 141201232241114 |
6 | 5112213305141 |
7 | 550540022554 |
oct | 124330660725 |
9 | 32220466507 |
10 | 11331133909 |
11 | 4895147687 |
12 | 22429351b1 |
13 | 10b7706584 |
14 | 796c69d9b |
15 | 464b9d024 |
hex | 2a36361d5 |
11331133909 has 2 divisors, whose sum is σ = 11331133910. Its totient is φ = 11331133908.
The previous prime is 11331133897. The next prime is 11331133937. The reversal of 11331133909 is 90933113311.
11331133909 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., 10853055684 + 478078225 = 104178^2 + 21865^2 .
It is an emirp because it is prime and its reverse (90933113311) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11331133909 - 225 = 11297579477 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11331131909) 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, 5665566954 + 5665566955.
It is an arithmetic number, because the mean of its divisors is an integer number (5665566955).
Almost surely, 211331133909 is an apocalyptic number.
It is an amenable number.
11331133909 is a deficient number, since it is larger than the sum of its proper divisors (1).
11331133909 is an equidigital number, since it uses as much as digits as its factorization.
11331133909 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6561, while the sum is 34.
The spelling of 11331133909 in words is "eleven billion, three hundred thirty-one million, one hundred thirty-three thousand, nine hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •