Base | Representation |
---|---|
bin | 10100100101001010… |
… | …01101100111011001 |
3 | 1001112000221122111121 |
4 | 22102211031213121 |
5 | 140112041210400 |
6 | 5024221525241 |
7 | 540544223602 |
oct | 122245154731 |
9 | 31460848447 |
10 | 11049163225 |
11 | 475aa67961 |
12 | 2184413821 |
13 | 107117bc09 |
14 | 76b62ada9 |
15 | 44a05121a |
hex | 29294d9d9 |
11049163225 has 9 divisors (see below), whose sum is σ = 13701614143. Its totient is φ = 8838910120.
The previous prime is 11049163211. The next prime is 11049163249. The reversal of 11049163225 is 52236194011.
The square root of 11049163225 is 105115.
It is a perfect power (a square), and thus also a powerful number.
11049163225 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in only one way, i.e., 3977698761 + 7071464464 = 63069^2 + 84092^2 .
It is not a de Polignac number, because 11049163225 - 25 = 11049163193 is a prime.
It is a Duffinian number.
It is an unprimeable number.
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 in 8 ways as a sum of consecutive naturals, for example, 515064 + ... + 536086.
Almost surely, 211049163225 is an apocalyptic number.
11049163225 is the 105115-th square number.
11049163225 is the 52558-th centered octagonal number.
It is an amenable number.
11049163225 is a deficient number, since it is larger than the sum of its proper divisors (2652450918).
11049163225 is an frugal number, since it uses more digits than its factorization.
11049163225 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 42056 (or 21028 counting only the distinct ones).
The product of its (nonzero) digits is 12960, while the sum is 34.
The spelling of 11049163225 in words is "eleven billion, forty-nine million, one hundred sixty-three thousand, two hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •