Base | Representation |
---|---|
bin | 1100010111110100010010111… |
… | …1001111001101010001010111 |
3 | 11020011120201002211021010010022 |
4 | 3011331010233033031101113 |
5 | 1403103102124343020401 |
6 | 12323345410032415355 |
7 | 351244436250540656 |
oct | 30575045717152127 |
9 | 4204521084233108 |
10 | 870612138251351 |
11 | 23244959725a8a1 |
12 | 8178a56b6a755b |
13 | 2b4a34ac10b942 |
14 | 114dbbd0ac719d |
15 | 6a9b94654e71b |
hex | 317d12f3cd457 |
870612138251351 has 8 divisors (see below), whose sum is σ = 872516930973840. Its totient is φ = 868709170920448.
The previous prime is 870612138251333. The next prime is 870612138251371. The reversal of 870612138251351 is 153152831216078.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-870612138251351 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 870612138251293 and 870612138251302.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (870612138251371) 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, 455392961 + ... + 457300746.
It is an arithmetic number, because the mean of its divisors is an integer number (109064616371730).
Almost surely, 2870612138251351 is an apocalyptic number.
870612138251351 is a deficient number, since it is larger than the sum of its proper divisors (1904792722489).
870612138251351 is a wasteful number, since it uses less digits than its factorization.
870612138251351 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 912695793.
The product of its (nonzero) digits is 2419200, while the sum is 53.
The spelling of 870612138251351 in words is "eight hundred seventy trillion, six hundred twelve billion, one hundred thirty-eight million, two hundred fifty-one thousand, three hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •