Base | Representation |
---|---|
bin | 100111110000000011… |
… | …1111110001101111101 |
3 | 22011100012111012112102 |
4 | 1033200013332031331 |
5 | 2344311312033421 |
6 | 103114350514445 |
7 | 6111261554252 |
oct | 1174007761575 |
9 | 264305435472 |
10 | 85364564861 |
11 | 33226087064 |
12 | 14664505a25 |
13 | 8085679154 |
14 | 41bb419429 |
15 | 234943960b |
hex | 13e01fe37d |
85364564861 has 4 divisors (see below), whose sum is σ = 86638662912. Its totient is φ = 84090466812.
The previous prime is 85364564821. The next prime is 85364564863. The reversal of 85364564861 is 16846546358.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 16846546358 = 2 ⋅8423273179.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-85364564861 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 85364564797 and 85364564806.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (85364564863) 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, 637048925 + ... + 637049058.
It is an arithmetic number, because the mean of its divisors is an integer number (21659665728).
Almost surely, 285364564861 is an apocalyptic number.
It is an amenable number.
85364564861 is a deficient number, since it is larger than the sum of its proper divisors (1274098051).
85364564861 is a wasteful number, since it uses less digits than its factorization.
85364564861 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1274098050.
The product of its digits is 16588800, while the sum is 56.
The spelling of 85364564861 in words is "eighty-five billion, three hundred sixty-four million, five hundred sixty-four thousand, eight hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •