Base | Representation |
---|---|
bin | 11001010101101010000… |
… | …10001011001100110011 |
3 | 10002020020001022221221210 |
4 | 30222311002023030303 |
5 | 103231012340440201 |
6 | 1503542501451203 |
7 | 116620535223621 |
oct | 14526502131463 |
9 | 3066201287853 |
10 | 870620640051 |
11 | 306256721928 |
12 | 120895110b03 |
13 | 64139b68456 |
14 | 301d1578511 |
15 | 179a814b1d6 |
hex | cab508b333 |
870620640051 has 4 divisors (see below), whose sum is σ = 1160827520072. Its totient is φ = 580413760032.
The previous prime is 870620640023. The next prime is 870620640079. The reversal of 870620640051 is 150046026078.
It is a semiprime because it is the product of two primes.
It is an interprime number because it is at equal distance from previous prime (870620640023) and next prime (870620640079).
It is not a de Polignac number, because 870620640051 - 211 = 870620638003 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 870620639991 and 870620640009.
It is not an unprimeable number, because it can be changed into a prime (870620640011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 145103440006 + ... + 145103440011.
It is an arithmetic number, because the mean of its divisors is an integer number (290206880018).
Almost surely, 2870620640051 is an apocalyptic number.
870620640051 is a deficient number, since it is larger than the sum of its proper divisors (290206880021).
870620640051 is a wasteful number, since it uses less digits than its factorization.
870620640051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 290206880020.
The product of its (nonzero) digits is 80640, while the sum is 39.
The spelling of 870620640051 in words is "eight hundred seventy billion, six hundred twenty million, six hundred forty thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •