Base | Representation |
---|---|
bin | 10100101011010101… |
… | …10101100001011001 |
3 | 1001122122102122201211 |
4 | 22111222311201121 |
5 | 140213322002144 |
6 | 5033312143121 |
7 | 542043452152 |
oct | 122552654131 |
9 | 31578378654 |
10 | 11100969049 |
11 | 4787231395 |
12 | 2199837aa1 |
13 | 107bb1a251 |
14 | 774474929 |
15 | 44e886034 |
hex | 295ab5859 |
11100969049 has 2 divisors, whose sum is σ = 11100969050. Its totient is φ = 11100969048.
The previous prime is 11100969041. The next prime is 11100969059. The reversal of 11100969049 is 94096900111.
11100969049 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., 6425144649 + 4675824400 = 80157^2 + 68380^2 .
It is a cyclic number.
It is not a de Polignac number, because 11100969049 - 23 = 11100969041 is a prime.
It is not a weakly prime, because it can be changed into another prime (11100969041) 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, 5550484524 + 5550484525.
It is an arithmetic number, because the mean of its divisors is an integer number (5550484525).
Almost surely, 211100969049 is an apocalyptic number.
It is an amenable number.
11100969049 is a deficient number, since it is larger than the sum of its proper divisors (1).
11100969049 is an equidigital number, since it uses as much as digits as its factorization.
11100969049 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 17496, while the sum is 40.
The spelling of 11100969049 in words is "eleven billion, one hundred million, nine hundred sixty-nine thousand, forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •