Base | Representation |
---|---|
bin | 101000010001101010… |
… | …0011010100010011111 |
3 | 22021020202202202201001 |
4 | 1100203110122202133 |
5 | 2404113411300223 |
6 | 103422301331131 |
7 | 6151231006642 |
oct | 1204324324237 |
9 | 267222682631 |
10 | 86491900063 |
11 | 33754471748 |
12 | 14919b66aa7 |
13 | 82050aabba |
14 | 4287031a59 |
15 | 23b33be9ad |
hex | 142351a89f |
86491900063 has 4 divisors (see below), whose sum is σ = 86813431560. Its totient is φ = 86170368568.
The previous prime is 86491900057. The next prime is 86491900069. The reversal of 86491900063 is 36000919468.
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 (86491900057) and next prime (86491900069).
It is a cyclic number.
It is not a de Polignac number, because 86491900063 - 25 = 86491900031 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 86491899986 and 86491900022.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (86491900069) 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, 160765345 + ... + 160765882.
It is an arithmetic number, because the mean of its divisors is an integer number (21703357890).
Almost surely, 286491900063 is an apocalyptic number.
86491900063 is a deficient number, since it is larger than the sum of its proper divisors (321531497).
86491900063 is a wasteful number, since it uses less digits than its factorization.
86491900063 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 321531496.
The product of its (nonzero) digits is 279936, while the sum is 46.
The spelling of 86491900063 in words is "eighty-six billion, four hundred ninety-one million, nine hundred thousand, sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •