Base | Representation |
---|---|
bin | 101000100000101010… |
… | …0000100111110101111 |
3 | 22022112211200101222122 |
4 | 1101001110010332233 |
5 | 2411131223100424 |
6 | 103544235303155 |
7 | 6166551250325 |
oct | 1210124047657 |
9 | 268484611878 |
10 | 86995128239 |
11 | 339925334a8 |
12 | 14a3a5aaabb |
13 | 8285423456 |
14 | 42d3bc7d15 |
15 | 23e267445e |
hex | 1441504faf |
86995128239 has 4 divisors (see below), whose sum is σ = 87972601680. Its totient is φ = 86017654800.
The previous prime is 86995128193. The next prime is 86995128281. The reversal of 86995128239 is 93282159968.
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 86995128239 - 224 = 86978351023 is a prime.
It is a super-2 number, since 2×869951282392 (a number of 23 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 (86995128299) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 488736587 + ... + 488736764.
It is an arithmetic number, because the mean of its divisors is an integer number (21993150420).
Almost surely, 286995128239 is an apocalyptic number.
86995128239 is a gapful number since it is divisible by the number (89) formed by its first and last digit.
86995128239 is a deficient number, since it is larger than the sum of its proper divisors (977473441).
86995128239 is an equidigital number, since it uses as much as digits as its factorization.
86995128239 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 977473440.
The product of its digits is 16796160, while the sum is 62.
The spelling of 86995128239 in words is "eighty-six billion, nine hundred ninety-five million, one hundred twenty-eight thousand, two hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •