Base | Representation |
---|---|
bin | 10001000001101… |
… | …101111001001100 |
3 | 201220112011200120 |
4 | 101001231321030 |
5 | 1041112202141 |
6 | 44202424540 |
7 | 10036044066 |
oct | 2101557114 |
9 | 656464616 |
10 | 285662796 |
11 | 137281761 |
12 | 7b802150 |
13 | 4724b053 |
14 | 29d20736 |
15 | 1a12ac66 |
hex | 1106de4c |
285662796 has 48 divisors (see below), whose sum is σ = 703718400. Its totient is φ = 89940672.
The previous prime is 285662771. The next prime is 285662807. The reversal of 285662796 is 697266582.
285662796 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 83365 + ... + 86723.
It is an arithmetic number, because the mean of its divisors is an integer number (14660800).
Almost surely, 2285662796 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 285662796, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (351859200).
285662796 is an abundant number, since it is smaller than the sum of its proper divisors (418055604).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
285662796 is a wasteful number, since it uses less digits than its factorization.
285662796 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3758 (or 3756 counting only the distinct ones).
The product of its digits is 2177280, while the sum is 51.
The square root of 285662796 is about 16901.5619396552. The cubic root of 285662796 is about 658.5941886235.
The spelling of 285662796 in words is "two hundred eighty-five million, six hundred sixty-two thousand, seven hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •