Base | Representation |
---|---|
bin | 10001000000010… |
… | …101010100100000 |
3 | 201212211202000200 |
4 | 101000111110200 |
5 | 1041014100000 |
6 | 44150545200 |
7 | 10033003266 |
oct | 2100252440 |
9 | 655752020 |
10 | 285300000 |
11 | 137054127 |
12 | 7b668200 |
13 | 47151b8b |
14 | 29c68436 |
15 | 1a0a8500 |
hex | 11015520 |
285300000 has 216 divisors, whose sum is σ = 1017286452. Its totient is φ = 75840000.
The previous prime is 285299977. The next prime is 285300013. The reversal of 285300000 is 3582.
It can be written as a sum of positive squares in 6 ways, for example, as 98485776 + 186814224 = 9924^2 + 13668^2 .
It is a Harshad number since it is a multiple of its sum of digits (18).
It is an unprimeable number.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 899842 + ... + 900158.
Almost surely, 2285300000 is an apocalyptic number.
285300000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 285300000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (508643226).
285300000 is an abundant number, since it is smaller than the sum of its proper divisors (731986452).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
285300000 is an equidigital number, since it uses as much as digits as its factorization.
285300000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 358 (or 327 counting only the distinct ones).
The product of its (nonzero) digits is 240, while the sum is 18.
The square root of 285300000 is about 16890.8259123111. The cubic root of 285300000 is about 658.3152623714.
Adding to 285300000 its reverse (3582), we get a palindrome (285303582).
The spelling of 285300000 in words is "two hundred eighty-five million, three hundred thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •