Base | Representation |
---|---|
bin | 1100010111110110000000000… |
… | …1011010001001111111010111 |
3 | 11020011200111201111122111011121 |
4 | 3011331200001122021333113 |
5 | 1403104042124120000011 |
6 | 12323411053033144411 |
7 | 351246524240514616 |
oct | 30575400132117727 |
9 | 4204614644574147 |
10 | 870641434140631 |
11 | 23245aa5aaa703a |
12 | 8179418685b107 |
13 | 2b4a619a65557a |
14 | 114dd3ad80787d |
15 | 6a9c5ad442e71 |
hex | 317d801689fd7 |
870641434140631 has 4 divisors (see below), whose sum is σ = 870730997100064. Its totient is φ = 870551871181200.
The previous prime is 870641434140623. The next prime is 870641434140721. The reversal of 870641434140631 is 136041434146078.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 870641434140631 - 23 = 870641434140623 is a prime.
It is a super-2 number, since 2×8706414341406312 (a number of 31 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (870641434140931) 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, 44781465135 + ... + 44781484576.
It is an arithmetic number, because the mean of its divisors is an integer number (217682749275016).
Almost surely, 2870641434140631 is an apocalyptic number.
870641434140631 is a deficient number, since it is larger than the sum of its proper divisors (89562959433).
870641434140631 is an equidigital number, since it uses as much as digits as its factorization.
870641434140631 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 89562959432.
The product of its (nonzero) digits is 4644864, while the sum is 52.
The spelling of 870641434140631 in words is "eight hundred seventy trillion, six hundred forty-one billion, four hundred thirty-four million, one hundred forty thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •