Base | Representation |
---|---|
bin | 10101000100111110… |
… | …10000001101101101 |
3 | 1002012122010012202112 |
4 | 22202133100031231 |
5 | 141133401131321 |
6 | 5110513533405 |
7 | 550264502642 |
oct | 124237201555 |
9 | 32178105675 |
10 | 11316036461 |
11 | 4887675754 |
12 | 2239874265 |
13 | 10b454b782 |
14 | 794c59dc9 |
15 | 4636b9a5b |
hex | 2a27d036d |
11316036461 has 2 divisors, whose sum is σ = 11316036462. Its totient is φ = 11316036460.
The previous prime is 11316036353. The next prime is 11316036481. The reversal of 11316036461 is 16463061311.
11316036461 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9686299561 + 1629736900 = 98419^2 + 40370^2 .
It is a cyclic number.
It is not a de Polignac number, because 11316036461 - 226 = 11248927597 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11316036481) 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, 5658018230 + 5658018231.
It is an arithmetic number, because the mean of its divisors is an integer number (5658018231).
Almost surely, 211316036461 is an apocalyptic number.
It is an amenable number.
11316036461 is a deficient number, since it is larger than the sum of its proper divisors (1).
11316036461 is an equidigital number, since it uses as much as digits as its factorization.
11316036461 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7776, while the sum is 32.
Adding to 11316036461 its reverse (16463061311), we get a palindrome (27779097772).
The spelling of 11316036461 in words is "eleven billion, three hundred sixteen million, thirty-six thousand, four hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •