Base | Representation |
---|---|
bin | 10101000101000001… |
… | …11111010101111001 |
3 | 1002012122222100011001 |
4 | 22202200333111321 |
5 | 141134010213031 |
6 | 5110531405001 |
7 | 550301410000 |
oct | 124240772571 |
9 | 32178870131 |
10 | 11316491641 |
11 | 4887956734 |
12 | 2239a53761 |
13 | 10b467aa00 |
14 | 794d37c37 |
15 | 463759861 |
hex | 2a283f579 |
11316491641 has 45 divisors (see below), whose sum is σ = 14381541231. Its totient is φ = 8900092656.
The previous prime is 11316491629. The next prime is 11316491657. The reversal of 11316491641 is 14619461311.
11316491641 = T11558 + T11559 + ... + T11724.
The square root of 11316491641 is 106379.
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., 1674037225 + 9642454416 = 40915^2 + 98196^2 .
It is not a de Polignac number, because 11316491641 - 233 = 2726557049 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 11316491641.
It is not an unprimeable number, because it can be changed into a prime (11316191641) by changing a digit.
It is a polite number, since it can be written in 44 ways as a sum of consecutive naturals, for example, 67763340 + ... + 67763506.
Almost surely, 211316491641 is an apocalyptic number.
11316491641 is the 106379-th square number.
11316491641 is the 53190-th centered octagonal number.
It is an amenable number.
11316491641 is a deficient number, since it is larger than the sum of its proper divisors (3065049590).
11316491641 is an frugal number, since it uses more digits than its factorization.
11316491641 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 388 (or 187 counting only the distinct ones).
The product of its digits is 15552, while the sum is 37.
The spelling of 11316491641 in words is "eleven billion, three hundred sixteen million, four hundred ninety-one thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •