Base | Representation |
---|---|
bin | 100111110111110101… |
… | …0011001011110110001 |
3 | 22012000101000021010002 |
4 | 1033233222121132301 |
5 | 2400330030411130 |
6 | 103200302115345 |
7 | 6120605411366 |
oct | 1175752313661 |
9 | 265011007102 |
10 | 85625247665 |
11 | 3334a2469a1 |
12 | 1471787bb55 |
13 | 80c768c129 |
14 | 4203cb646d |
15 | 236227db45 |
hex | 13efa997b1 |
85625247665 has 8 divisors (see below), whose sum is σ = 107217701568. Its totient is φ = 65521928560.
The previous prime is 85625247661. The next prime is 85625247689. The reversal of 85625247665 is 56674252658.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 85625247665 - 22 = 85625247661 is a prime.
It is a super-3 number, since 3×856252476653 (a number of 34 digits) contains 333 as substring.
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 85625247665.
It is not an unprimeable number, because it can be changed into a prime (85625247661) 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 7 ways as a sum of consecutive naturals, for example, 372283571 + ... + 372283800.
It is an arithmetic number, because the mean of its divisors is an integer number (13402212696).
Almost surely, 285625247665 is an apocalyptic number.
It is an amenable number.
85625247665 is a deficient number, since it is larger than the sum of its proper divisors (21592453903).
85625247665 is a wasteful number, since it uses less digits than its factorization.
85625247665 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 744567399.
The product of its digits is 24192000, while the sum is 56.
The spelling of 85625247665 in words is "eighty-five billion, six hundred twenty-five million, two hundred forty-seven thousand, six hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •