Base | Representation |
---|---|
bin | 10100011111011110… |
… | …00100100100011001 |
3 | 1001101201002211120102 |
4 | 22033233010210121 |
5 | 140012330302321 |
6 | 5015354305145 |
7 | 536424331004 |
oct | 121757044431 |
9 | 31351084512 |
10 | 11001415961 |
11 | 4736015708 |
12 | 21704281b5 |
13 | 1064301cb3 |
14 | 76515c53b |
15 | 445c6dc0b |
hex | 28fbc4919 |
11001415961 has 2 divisors, whose sum is σ = 11001415962. Its totient is φ = 11001415960.
The previous prime is 11001415951. The next prime is 11001416003. The reversal of 11001415961 is 16951410011.
11001415961 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., 10559617600 + 441798361 = 102760^2 + 21019^2 .
It is an emirp because it is prime and its reverse (16951410011) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11001415961 - 222 = 10997221657 is a prime.
It is not a weakly prime, because it can be changed into another prime (11001415951) 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, 5500707980 + 5500707981.
It is an arithmetic number, because the mean of its divisors is an integer number (5500707981).
Almost surely, 211001415961 is an apocalyptic number.
It is an amenable number.
11001415961 is a deficient number, since it is larger than the sum of its proper divisors (1).
11001415961 is an equidigital number, since it uses as much as digits as its factorization.
11001415961 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1080, while the sum is 29.
Adding to 11001415961 its reverse (16951410011), we get a palindrome (27952825972).
The spelling of 11001415961 in words is "eleven billion, one million, four hundred fifteen thousand, nine hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •