Base | Representation |
---|---|
bin | 10101100110111100… |
… | …11111110101111001 |
3 | 1002221111102110012121 |
4 | 22303132133311321 |
5 | 142224332113001 |
6 | 5155054441241 |
7 | 560325210061 |
oct | 126336376571 |
9 | 32844373177 |
10 | 11601051001 |
11 | 4a13544361 |
12 | 22b9203221 |
13 | 112b600727 |
14 | 7c0a4c3a1 |
15 | 47d7186a1 |
hex | 2b379fd79 |
11601051001 has 2 divisors, whose sum is σ = 11601051002. Its totient is φ = 11601051000.
The previous prime is 11601050977. The next prime is 11601051053. The reversal of 11601051001 is 10015010611.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 11459916601 + 141134400 = 107051^2 + 11880^2 .
It is an emirp because it is prime and its reverse (10015010611) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11601051001 - 213 = 11601042809 is a prime.
It is not a weakly prime, because it can be changed into another prime (11601051701) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5800525500 + 5800525501.
It is an arithmetic number, because the mean of its divisors is an integer number (5800525501).
Almost surely, 211601051001 is an apocalyptic number.
It is an amenable number.
11601051001 is a deficient number, since it is larger than the sum of its proper divisors (1).
11601051001 is an equidigital number, since it uses as much as digits as its factorization.
11601051001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 30, while the sum is 16.
Adding to 11601051001 its reverse (10015010611), we get a palindrome (21616061612).
The spelling of 11601051001 in words is "eleven billion, six hundred one million, fifty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •