Base | Representation |
---|---|
bin | 10101011001110111… |
… | …10110110101100101 |
3 | 1002122211220212112112 |
4 | 22230323312311211 |
5 | 142013233304403 |
6 | 5140134330405 |
7 | 554523332225 |
oct | 125473666545 |
9 | 32584825475 |
10 | 11491306853 |
11 | 49675a7a14 |
12 | 22884b9a05 |
13 | 1111957970 |
14 | 7b0242085 |
15 | 473c8b9d8 |
hex | 2acef6d65 |
11491306853 has 8 divisors (see below), whose sum is σ = 12484770648. Its totient is φ = 10513488384.
The previous prime is 11491306807. The next prime is 11491306873. The reversal of 11491306853 is 35860319411.
It can be written as a sum of positive squares in 4 ways, for example, as 461476324 + 11029830529 = 21482^2 + 105023^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 11491306853 - 28 = 11491306597 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11491306853.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11491306873) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3909800 + ... + 3912737.
It is an arithmetic number, because the mean of its divisors is an integer number (1560596331).
Almost surely, 211491306853 is an apocalyptic number.
11491306853 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
11491306853 is a deficient number, since it is larger than the sum of its proper divisors (993463795).
11491306853 is a wasteful number, since it uses less digits than its factorization.
11491306853 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7822663.
The product of its (nonzero) digits is 77760, while the sum is 41.
The spelling of 11491306853 in words is "eleven billion, four hundred ninety-one million, three hundred six thousand, eight hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •