Base | Representation |
---|---|
bin | 10011101000001011010010… |
… | …010100111010000011111011 |
3 | 102022122110202202020110022210 |
4 | 103220023102110322003323 |
5 | 42303312101020123232 |
6 | 503332333034550203 |
7 | 24116454530166144 |
oct | 2350132224720373 |
9 | 368573682213283 |
10 | 86323781411067 |
11 | 2556178a171a22 |
12 | 9822163898363 |
13 | 39223b3c54885 |
14 | 17461440a0acb |
15 | 9ea72dc945cc |
hex | 4e82d253a0fb |
86323781411067 has 16 divisors (see below), whose sum is σ = 119732465088000. Its totient is φ = 55254315350304.
The previous prime is 86323781411059. The next prime is 86323781411081. The reversal of 86323781411067 is 76011418732368.
It is not a de Polignac number, because 86323781411067 - 23 = 86323781411059 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 86323781410998 and 86323781411016.
It is not an unprimeable number, because it can be changed into a prime (86323781451067) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2771569267 + ... + 2771600412.
It is an arithmetic number, because the mean of its divisors is an integer number (7483279068000).
Almost surely, 286323781411067 is an apocalyptic number.
86323781411067 is a gapful number since it is divisible by the number (87) formed by its first and last digit.
86323781411067 is a deficient number, since it is larger than the sum of its proper divisors (33408683676933).
86323781411067 is a wasteful number, since it uses less digits than its factorization.
86323781411067 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5543169890.
The product of its (nonzero) digits is 8128512, while the sum is 57.
The spelling of 86323781411067 in words is "eighty-six trillion, three hundred twenty-three billion, seven hundred eighty-one million, four hundred eleven thousand, sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •