Base | Representation |
---|---|
bin | 10100111011100001… |
… | …10010011011000101 |
3 | 1002000002220212222221 |
4 | 22131300302123011 |
5 | 141003101400244 |
6 | 5055002252341 |
7 | 545312526121 |
oct | 123560623305 |
9 | 32002825887 |
10 | 11236746949 |
11 | 484693a32a |
12 | 22171b70b1 |
13 | 10a0ca98bc |
14 | 7884da581 |
15 | 45b756784 |
hex | 29dc326c5 |
11236746949 has 2 divisors, whose sum is σ = 11236746950. Its totient is φ = 11236746948.
The previous prime is 11236746869. The next prime is 11236746977. The reversal of 11236746949 is 94964763211.
11236746949 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., 10942624449 + 294122500 = 104607^2 + 17150^2 .
It is a cyclic number.
It is not a de Polignac number, because 11236746949 - 211 = 11236744901 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11236746896 and 11236746905.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11236746449) 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, 5618373474 + 5618373475.
It is an arithmetic number, because the mean of its divisors is an integer number (5618373475).
Almost surely, 211236746949 is an apocalyptic number.
It is an amenable number.
11236746949 is a deficient number, since it is larger than the sum of its proper divisors (1).
11236746949 is an equidigital number, since it uses as much as digits as its factorization.
11236746949 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1959552, while the sum is 52.
The spelling of 11236746949 in words is "eleven billion, two hundred thirty-six million, seven hundred forty-six thousand, nine hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •