Base | Representation |
---|---|
bin | 10001000001110… |
… | …000111111000000 |
3 | 201220112211001110 |
4 | 101001300333000 |
5 | 1041113103311 |
6 | 44203003320 |
7 | 10036126023 |
oct | 2101607700 |
9 | 656484043 |
10 | 285675456 |
11 | 137290220 |
12 | 7b809540 |
13 | 47253a41 |
14 | 29d251ba |
15 | 1a12e8a6 |
hex | 11070fc0 |
285675456 has 112 divisors (see below), whose sum is σ = 860560128. Its totient is φ = 82790400.
The previous prime is 285675449. The next prime is 285675461. The reversal of 285675456 is 654576582.
It is a happy number.
It is a super-2 number, since 2×2856754562 = 163220932321615872, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is a congruent number.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 45636 + ... + 51516.
Almost surely, 2285675456 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 285675456, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (430280064).
285675456 is an abundant number, since it is smaller than the sum of its proper divisors (574884672).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
285675456 is a wasteful number, since it uses less digits than its factorization.
285675456 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5930 (or 5920 counting only the distinct ones).
The product of its digits is 2016000, while the sum is 48.
The square root of 285675456 is about 16901.9364571046. The cubic root of 285675456 is about 658.6039176693.
The spelling of 285675456 in words is "two hundred eighty-five million, six hundred seventy-five thousand, four hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •