Base | Representation |
---|---|
bin | 10000100000011100… |
… | …00011001100011101 |
3 | 211212121111221111201 |
4 | 20100032003030131 |
5 | 121122141200044 |
6 | 4023212315501 |
7 | 432416131435 |
oct | 102016031435 |
9 | 24777457451 |
10 | 8862053149 |
11 | 3838441774 |
12 | 1873a72b91 |
13 | ab3011641 |
14 | 600d872c5 |
15 | 36d02d7d4 |
hex | 21038331d |
8862053149 has 2 divisors, whose sum is σ = 8862053150. Its totient is φ = 8862053148.
The previous prime is 8862053147. The next prime is 8862053209. The reversal of 8862053149 is 9413502688.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 5066877124 + 3795176025 = 71182^2 + 61605^2 .
It is a cyclic number.
It is not a de Polignac number, because 8862053149 - 21 = 8862053147 is a prime.
Together with 8862053147, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 8862053099 and 8862053108.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (8862053141) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 4431026574 + 4431026575.
It is an arithmetic number, because the mean of its divisors is an integer number (4431026575).
Almost surely, 28862053149 is an apocalyptic number.
It is an amenable number.
8862053149 is a deficient number, since it is larger than the sum of its proper divisors (1).
8862053149 is an equidigital number, since it uses as much as digits as its factorization.
8862053149 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 414720, while the sum is 46.
The square root of 8862053149 is about 94138.4785781032. The cubic root of 8862053149 is about 2069.4016138552.
The spelling of 8862053149 in words is "eight billion, eight hundred sixty-two million, fifty-three thousand, one hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •