Base | Representation |
---|---|
bin | 10011100111001100000010… |
… | …001000101111111111001111 |
3 | 102022101222110110202020001221 |
4 | 103213030002020233333033 |
5 | 42301204002144204321 |
6 | 503241221422144211 |
7 | 24111531502162012 |
oct | 2347140210577717 |
9 | 368358413666057 |
10 | 86255864053711 |
11 | 255359a7633120 |
12 | 9810b6a422067 |
13 | 3918b7c12b761 |
14 | 1742b3dcd7379 |
15 | 9e8aa641ce41 |
hex | 4e730222ffcf |
86255864053711 has 32 divisors (see below), whose sum is σ = 99147902929920. Its totient is φ = 74272306944000.
The previous prime is 86255864053693. The next prime is 86255864053729. The reversal of 86255864053711 is 11735046855268.
It is an interprime number because it is at equal distance from previous prime (86255864053693) and next prime (86255864053729).
It is not a de Polignac number, because 86255864053711 - 217 = 86255863922639 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 86255864053711.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (86255864053741) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 461906661 + ... + 462093361.
It is an arithmetic number, because the mean of its divisors is an integer number (3098371966560).
Almost surely, 286255864053711 is an apocalyptic number.
86255864053711 is a deficient number, since it is larger than the sum of its proper divisors (12892038876209).
86255864053711 is a wasteful number, since it uses less digits than its factorization.
86255864053711 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 204567.
The product of its (nonzero) digits is 48384000, while the sum is 61.
The spelling of 86255864053711 in words is "eighty-six trillion, two hundred fifty-five billion, eight hundred sixty-four million, fifty-three thousand, seven hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •