Base | Representation |
---|---|
bin | 10001000001101… |
… | …000101101000010 |
3 | 201220111002112020 |
4 | 101001220231002 |
5 | 1041111012123 |
6 | 44202142310 |
7 | 10035625110 |
oct | 2101505502 |
9 | 656432466 |
10 | 285641538 |
11 | 137267796 |
12 | 7b7b1996 |
13 | 47241480 |
14 | 29d16ab0 |
15 | 1a1247e3 |
hex | 11068b42 |
285641538 has 64 divisors (see below), whose sum is σ = 715115520. Its totient is φ = 74048832.
The previous prime is 285641519. The next prime is 285641549. The reversal of 285641538 is 835146582.
285641538 is digitally balanced in base 3, 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 (42).
It is a self number, because there is not a number n which added to its sum of digits gives 285641538.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 27781 + ... + 36647.
It is an arithmetic number, because the mean of its divisors is an integer number (11173680).
Almost surely, 2285641538 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 285641538, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (357557760).
285641538 is an abundant number, since it is smaller than the sum of its proper divisors (429473982).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
285641538 is a wasteful number, since it uses less digits than its factorization.
285641538 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8951.
The product of its digits is 230400, while the sum is 42.
The square root of 285641538 is about 16900.9330511661. The cubic root of 285641538 is about 658.5778514796.
The spelling of 285641538 in words is "two hundred eighty-five million, six hundred forty-one thousand, five hundred thirty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •