Base | Representation |
---|---|
bin | 1010001110010… |
… | …10010100010010 |
3 | 12222101020012020 |
4 | 11013022110102 |
5 | 133423411341 |
6 | 12302112310 |
7 | 2060655624 |
oct | 507122422 |
9 | 188336166 |
10 | 85763346 |
11 | 444582a9 |
12 | 2487b696 |
13 | 149ca756 |
14 | b566c14 |
15 | 77e1566 |
hex | 51ca512 |
85763346 has 8 divisors (see below), whose sum is σ = 171526704. Its totient is φ = 28587780.
The previous prime is 85763341. The next prime is 85763369. The reversal of 85763346 is 64336758.
It is a sphenic number, since it is the product of 3 distinct primes.
85763346 is an admirable number.
It is a Smith number, since the sum of its digits (42) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a junction number, because it is equal to n+sod(n) for n = 85763298 and 85763307.
It is not an unprimeable number, because it can be changed into a prime (85763341) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 7146940 + ... + 7146951.
It is an arithmetic number, because the mean of its divisors is an integer number (21440838).
Almost surely, 285763346 is an apocalyptic number.
85763346 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
85763346 is a wasteful number, since it uses less digits than its factorization.
85763346 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14293896.
The product of its digits is 362880, while the sum is 42.
The square root of 85763346 is about 9260.8501769546. The cubic root of 85763346 is about 440.9952437000.
The spelling of 85763346 in words is "eighty-five million, seven hundred sixty-three thousand, three hundred forty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •