Base | Representation |
---|---|
bin | 11001111100010010100 |
3 | 1121012002000 |
4 | 3033202110 |
5 | 204200233 |
6 | 30115300 |
7 | 10140222 |
oct | 3174224 |
9 | 1535060 |
10 | 850068 |
11 | 53073a |
12 | 34bb30 |
13 | 239bcb |
14 | 181b12 |
15 | 11bd13 |
hex | cf894 |
850068 has 48 divisors (see below), whose sum is σ = 2338560. Its totient is φ = 266112.
The previous prime is 850063. The next prime is 850081. The reversal of 850068 is 860058.
850068 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is an Ulam number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (850061) by changing a digit.
850068 is an untouchable number, because it is not equal to the sum of proper divisors of any number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1605 + ... + 2067.
It is an arithmetic number, because the mean of its divisors is an integer number (48720).
2850068 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 850068, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1169280).
850068 is an abundant number, since it is smaller than the sum of its proper divisors (1488492).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
850068 is a wasteful number, since it uses less digits than its factorization.
850068 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 493 (or 485 counting only the distinct ones).
The product of its (nonzero) digits is 1920, while the sum is 27.
The square root of 850068 is about 921.9913231696. The cubic root of 850068 is about 94.7293496999.
The spelling of 850068 in words is "eight hundred fifty thousand, sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •