Base | Representation |
---|---|
bin | 1010001011110000001110… |
… | …1010011001001000111101 |
3 | 1110122102112001102000010201 |
4 | 2202330003222121020331 |
5 | 2431423020020412331 |
6 | 35451503312003501 |
7 | 2233650055500454 |
oct | 242740352311075 |
9 | 43572461360121 |
10 | 11197041185341 |
11 | 362770292a940 |
12 | 130a08a530591 |
13 | 632b5174bc0b |
14 | 2a9d226d1b9b |
15 | 1463d9ec2a61 |
hex | a2f03a9923d |
11197041185341 has 16 divisors (see below), whose sum is σ = 12305112058368. Its totient is φ = 10104227481600.
The previous prime is 11197041185321. The next prime is 11197041185383. The reversal of 11197041185341 is 14358114079111.
It is a cyclic number.
It is not a de Polignac number, because 11197041185341 - 213 = 11197041177149 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11197041185291 and 11197041185300.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11197041185321) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4800205 + ... + 6740626.
It is an arithmetic number, because the mean of its divisors is an integer number (769069503648).
Almost surely, 211197041185341 is an apocalyptic number.
11197041185341 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
11197041185341 is a deficient number, since it is larger than the sum of its proper divisors (1108070873027).
11197041185341 is a wasteful number, since it uses less digits than its factorization.
11197041185341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11541492.
The product of its (nonzero) digits is 120960, while the sum is 46.
The spelling of 11197041185341 in words is "eleven trillion, one hundred ninety-seven billion, forty-one million, one hundred eighty-five thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •