Base | Representation |
---|---|
bin | 1100010111011101010110111… |
… | …0110100101011010100001001 |
3 | 11020010012000221101122120200202 |
4 | 3011313111232310223110021 |
5 | 1403030123100410001423 |
6 | 12322444354520341545 |
7 | 351204115651221152 |
oct | 30567255664532411 |
9 | 4203160841576622 |
10 | 870218068047113 |
11 | 232307456968855 |
12 | 817261123148b5 |
13 | 2b47529a1588b6 |
14 | 114c6aca29a929 |
15 | 6a91580522728 |
hex | 317756ed2b509 |
870218068047113 has 8 divisors (see below), whose sum is σ = 876955140059400. Its totient is φ = 863492951799040.
The previous prime is 870218068047049. The next prime is 870218068047193. The reversal of 870218068047113 is 311740860812078.
It can be written as a sum of positive squares in 4 ways, for example, as 296397266980864 + 573820801066249 = 17216192^2 + 23954557^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 870218068047113 - 26 = 870218068047049 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (870218068047193) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2988794918 + ... + 2989086063.
It is an arithmetic number, because the mean of its divisors is an integer number (109619392507425).
Almost surely, 2870218068047113 is an apocalyptic number.
It is an amenable number.
870218068047113 is a deficient number, since it is larger than the sum of its proper divisors (6737072012287).
870218068047113 is a wasteful number, since it uses less digits than its factorization.
870218068047113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5977882107.
The product of its (nonzero) digits is 3612672, while the sum is 56.
The spelling of 870218068047113 in words is "eight hundred seventy trillion, two hundred eighteen billion, sixty-eight million, forty-seven thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •