Base | Representation |
---|---|
bin | 10101101010100010… |
… | …10100011000111101 |
3 | 1010000121001200011112 |
4 | 22311101110120331 |
5 | 142310033310103 |
6 | 5202051531405 |
7 | 561142102133 |
oct | 126521243075 |
9 | 33017050145 |
10 | 11631150653 |
11 | 4a29532701 |
12 | 23072b9b65 |
13 | 113490bb85 |
14 | 7c4a45753 |
15 | 4811b1cd8 |
hex | 2b545463d |
11631150653 has 2 divisors, whose sum is σ = 11631150654. Its totient is φ = 11631150652.
The previous prime is 11631150649. The next prime is 11631150667. The reversal of 11631150653 is 35605113611.
11631150653 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., 8370969049 + 3260181604 = 91493^2 + 57098^2 .
It is an emirp because it is prime and its reverse (35605113611) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11631150653 - 22 = 11631150649 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11631150683) 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, 5815575326 + 5815575327.
It is an arithmetic number, because the mean of its divisors is an integer number (5815575327).
Almost surely, 211631150653 is an apocalyptic number.
It is an amenable number.
11631150653 is a deficient number, since it is larger than the sum of its proper divisors (1).
11631150653 is an equidigital number, since it uses as much as digits as its factorization.
11631150653 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8100, while the sum is 32.
The spelling of 11631150653 in words is "eleven billion, six hundred thirty-one million, one hundred fifty thousand, six hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •