Base | Representation |
---|---|
bin | 1010011010011100101101… |
… | …1000110110000011000001 |
3 | 1111112120011100110021021201 |
4 | 2212213023120312003001 |
5 | 3000042034013202041 |
6 | 40203454443221201 |
7 | 2261125200231514 |
oct | 246471330660301 |
9 | 44476140407251 |
10 | 11449500131521 |
11 | 3714784377811 |
12 | 134aba6517801 |
13 | 6508b6094b3a |
14 | 2b8231908d7b |
15 | 14cc63b08631 |
hex | a69cb6360c1 |
11449500131521 has 9 divisors (see below), whose sum is σ = 11462749132899. Its totient is φ = 11436266437800.
The previous prime is 11449500131513. The next prime is 11449500131533. The reversal of 11449500131521 is 12513100594411.
The square root of 11449500131521 is 3383711.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 9432816121521 + 2016684010000 = 3071289^2 + 1420100^2 .
It is not a de Polignac number, because 11449500131521 - 23 = 11449500131513 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11449500138521) by changing a digit.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 4368369591 + ... + 4368372211.
Almost surely, 211449500131521 is an apocalyptic number.
11449500131521 is the 3383711-st square number.
11449500131521 is the 1691856-th centered octagonal number.
It is an amenable number.
11449500131521 is a deficient number, since it is larger than the sum of its proper divisors (13249001378).
11449500131521 is an frugal number, since it uses more digits than its factorization.
11449500131521 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7824 (or 3912 counting only the distinct ones).
The product of its (nonzero) digits is 21600, while the sum is 37.
The spelling of 11449500131521 in words is "eleven trillion, four hundred forty-nine billion, five hundred million, one hundred thirty-one thousand, five hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •