Base | Representation |
---|---|
bin | 101001011010… |
… | …001011000101 |
3 | 202102111102002 |
4 | 221122023011 |
5 | 10234330414 |
6 | 1024355045 |
7 | 161160356 |
oct | 51321305 |
9 | 22374362 |
10 | 10855109 |
11 | 6144671 |
12 | 3775a85 |
13 | 2330b55 |
14 | 1627d2d |
15 | e464de |
hex | a5a2c5 |
10855109 has 2 divisors, whose sum is σ = 10855110. Its totient is φ = 10855108.
The previous prime is 10855087. The next prime is 10855111. The reversal of 10855109 is 90155801.
10855109 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7579009 + 3276100 = 2753^2 + 1810^2 .
It is an emirp because it is prime and its reverse (90155801) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10855109 - 216 = 10789573 is a prime.
Together with 10855111, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10855199) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5427554 + 5427555.
It is an arithmetic number, because the mean of its divisors is an integer number (5427555).
Almost surely, 210855109 is an apocalyptic number.
It is an amenable number.
10855109 is a deficient number, since it is larger than the sum of its proper divisors (1).
10855109 is an equidigital number, since it uses as much as digits as its factorization.
10855109 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1800, while the sum is 29.
The square root of 10855109 is about 3294.7092436207. The cubic root of 10855109 is about 221.4172213002.
The spelling of 10855109 in words is "ten million, eight hundred fifty-five thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •