Base | Representation |
---|---|
bin | 101101010111… |
… | …000010100101 |
3 | 211101010011222 |
4 | 231113002211 |
5 | 11021001403 |
6 | 1102510125 |
7 | 203033132 |
oct | 55270245 |
9 | 24333158 |
10 | 11890853 |
11 | 6791857 |
12 | 3b95345 |
13 | 2604410 |
14 | 1817589 |
15 | 109d338 |
hex | b570a5 |
11890853 has 8 divisors (see below), whose sum is σ = 12843096. Its totient is φ = 10944000.
The previous prime is 11890807. The next prime is 11890873. The reversal of 11890853 is 35809811.
11890853 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 4 ways, for example, as 3694084 + 8196769 = 1922^2 + 2863^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 11890853 - 28 = 11890597 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11890873) 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, 4073 + ... + 6353.
It is an arithmetic number, because the mean of its divisors is an integer number (1605387).
Almost surely, 211890853 is an apocalyptic number.
11890853 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
11890853 is a deficient number, since it is larger than the sum of its proper divisors (952243).
11890853 is a wasteful number, since it uses less digits than its factorization.
11890853 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2695.
The product of its (nonzero) digits is 8640, while the sum is 35.
The square root of 11890853 is about 3448.3116158491. The cubic root of 11890853 is about 228.2466104082.
The spelling of 11890853 in words is "eleven million, eight hundred ninety thousand, eight hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.143 sec. • engine limits •