Base | Representation |
---|---|
bin | 11001010101000010010… |
… | …01110110110000000001 |
3 | 10002012100210201211112101 |
4 | 30222201021312300001 |
5 | 103224321444442441 |
6 | 1503445425030401 |
7 | 116606345241343 |
oct | 14524111666001 |
9 | 3065323654471 |
10 | 870287109121 |
11 | 3060a5426131 |
12 | 120801485401 |
13 | 640b5a2a481 |
14 | 3019d157293 |
15 | 17988c17231 |
hex | caa1276c01 |
870287109121 has 4 divisors (see below), whose sum is σ = 876548167600. Its totient is φ = 864026050644.
The previous prime is 870287109119. The next prime is 870287109217. The reversal of 870287109121 is 121901782078.
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, and also an emirpimes, since its reverse is a distinct semiprime: 121901782078 = 2 ⋅60950891039.
It is a cyclic number.
It is not a de Polignac number, because 870287109121 - 21 = 870287109119 is a prime.
It is a super-2 number, since 2×8702871091212 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (870287109421) 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, 3130529031 + ... + 3130529308.
It is an arithmetic number, because the mean of its divisors is an integer number (219137041900).
Almost surely, 2870287109121 is an apocalyptic number.
It is an amenable number.
870287109121 is a deficient number, since it is larger than the sum of its proper divisors (6261058479).
870287109121 is a wasteful number, since it uses less digits than its factorization.
870287109121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6261058478.
The product of its (nonzero) digits is 112896, while the sum is 46.
The spelling of 870287109121 in words is "eight hundred seventy billion, two hundred eighty-seven million, one hundred nine thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •