Base | Representation |
---|---|
bin | 10101000111011110… |
… | …00100001010111001 |
3 | 1002021002111011121101 |
4 | 22203233010022321 |
5 | 141204230134044 |
6 | 5112542211401 |
7 | 550640362402 |
oct | 124357041271 |
9 | 32232434541 |
10 | 11336958649 |
11 | 4898465915 |
12 | 2244883b61 |
13 | 10b8995873 |
14 | 7979449a9 |
15 | 46544dcd4 |
hex | 2a3bc42b9 |
11336958649 has 2 divisors, whose sum is σ = 11336958650. Its totient is φ = 11336958648.
The previous prime is 11336958637. The next prime is 11336958653. The reversal of 11336958649 is 94685963311.
11336958649 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., 11109160000 + 227798649 = 105400^2 + 15093^2 .
It is a cyclic number.
It is not a de Polignac number, because 11336958649 - 211 = 11336956601 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11336958649.
It is not a weakly prime, because it can be changed into another prime (11336958449) 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, 5668479324 + 5668479325.
It is an arithmetic number, because the mean of its divisors is an integer number (5668479325).
Almost surely, 211336958649 is an apocalyptic number.
It is an amenable number.
11336958649 is a deficient number, since it is larger than the sum of its proper divisors (1).
11336958649 is an equidigital number, since it uses as much as digits as its factorization.
11336958649 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 4199040, while the sum is 55.
The spelling of 11336958649 in words is "eleven billion, three hundred thirty-six million, nine hundred fifty-eight thousand, six hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •