Base | Representation |
---|---|
bin | 1010010000111011111111… |
… | …1011100100101001010001 |
3 | 1110221221101122200102200121 |
4 | 2210032333323210221101 |
5 | 2434402412340321231 |
6 | 40000432401150241 |
7 | 2243252025636502 |
oct | 244167773445121 |
9 | 43857348612617 |
10 | 11286099151441 |
11 | 3661453819a14 |
12 | 13233a392b381 |
13 | 63b37534b28a |
14 | 2b0370450ba9 |
15 | 14889d7bd311 |
hex | a43bfee4a51 |
11286099151441 has 9 divisors (see below), whose sum is σ = 11392925351899. Its totient is φ = 11180265484504.
The previous prime is 11286099151429. The next prime is 11286099151517. The reversal of 11286099151441 is 14415199068211.
The square root of 11286099151441 is 3359479.
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., 4785659388225 + 6500439763216 = 2187615^2 + 2549596^2 .
It is not a de Polignac number, because 11286099151441 - 211 = 11286099149393 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11286099151421) 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, 359448555 + ... + 359479951.
Almost surely, 211286099151441 is an apocalyptic number.
11286099151441 is the 3359479-th square number.
11286099151441 is the 1679740-th centered octagonal number.
It is an amenable number.
11286099151441 is a deficient number, since it is larger than the sum of its proper divisors (106826200458).
11286099151441 is an frugal number, since it uses more digits than its factorization.
11286099151441 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 63008 (or 31504 counting only the distinct ones).
The product of its (nonzero) digits is 622080, while the sum is 52.
The spelling of 11286099151441 in words is "eleven trillion, two hundred eighty-six billion, ninety-nine million, one hundred fifty-one thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •