Base | Representation |
---|---|
bin | 110011110111010… |
… | …010100001100001 |
3 | 2020122022021110001 |
4 | 303313102201201 |
5 | 3240223204214 |
6 | 222201540001 |
7 | 30363666301 |
oct | 6367224141 |
9 | 2218267401 |
10 | 870131809 |
11 | 4071919a8 |
12 | 2034a4601 |
13 | 10b3696c1 |
14 | 837c3601 |
15 | 515cbc74 |
hex | 33dd2861 |
870131809 has 4 divisors (see below), whose sum is σ = 915928240. Its totient is φ = 824335380.
The previous prime is 870131797. The next prime is 870131813. The reversal of 870131809 is 908131078.
870131809 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-870131809 is a prime.
It is a super-2 number, since 2×8701318092 = 1514258730067224962, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (870131869) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 22898187 + ... + 22898224.
It is an arithmetic number, because the mean of its divisors is an integer number (228982060).
Almost surely, 2870131809 is an apocalyptic number.
It is an amenable number.
870131809 is a deficient number, since it is larger than the sum of its proper divisors (45796431).
870131809 is a wasteful number, since it uses less digits than its factorization.
870131809 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 45796430.
The product of its (nonzero) digits is 12096, while the sum is 37.
The square root of 870131809 is about 29497.9966946910. The cubic root of 870131809 is about 954.6884792982.
The spelling of 870131809 in words is "eight hundred seventy million, one hundred thirty-one thousand, eight hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •