Base | Representation |
---|---|
bin | 1010101100010000… |
… | …1011110011100101 |
3 | 21102000102011001111 |
4 | 2223010023303211 |
5 | 21334210011434 |
6 | 1152442025021 |
7 | 131056414321 |
oct | 25304136345 |
9 | 7360364044 |
10 | 2870000869 |
11 | 124304a14a |
12 | 6811a8171 |
13 | 369799288 |
14 | 1d3246981 |
15 | 11be65964 |
hex | ab10bce5 |
2870000869 has 2 divisors, whose sum is σ = 2870000870. Its totient is φ = 2870000868.
The previous prime is 2870000849. The next prime is 2870000879. The reversal of 2870000869 is 9680000782.
2870000869 is digitally balanced in base 2, 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., 2868887844 + 1113025 = 53562^2 + 1055^2 .
It is a cyclic number.
It is not a de Polignac number, because 2870000869 - 213 = 2869992677 is a prime.
It is a super-2 number, since 2×28700008692 = 16473809976121510322, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2870000849) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1435000434 + 1435000435.
It is an arithmetic number, because the mean of its divisors is an integer number (1435000435).
Almost surely, 22870000869 is an apocalyptic number.
It is an amenable number.
2870000869 is a deficient number, since it is larger than the sum of its proper divisors (1).
2870000869 is an equidigital number, since it uses as much as digits as its factorization.
2870000869 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 48384, while the sum is 40.
The square root of 2870000869 is about 53572.3890544374. The cubic root of 2870000869 is about 1421.1088457649.
The spelling of 2870000869 in words is "two billion, eight hundred seventy million, eight hundred sixty-nine", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •