Base | Representation |
---|---|
bin | 10001000001111… |
… | …010011001101110 |
3 | 201220121202222010 |
4 | 101001322121232 |
5 | 1041120322110 |
6 | 44203502050 |
7 | 10036346340 |
oct | 2101723156 |
9 | 656552863 |
10 | 285714030 |
11 | 1373071a8 |
12 | 7b827926 |
13 | 47268474 |
14 | 29d35290 |
15 | 1a13b020 |
hex | 1107a66e |
285714030 has 64 divisors (see below), whose sum is σ = 792529920. Its totient is φ = 64568064.
The previous prime is 285714029. The next prime is 285714031. The reversal of 285714030 is 30417582.
It is an interprime number because it is at equal distance from previous prime (285714029) and next prime (285714031).
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (285714031) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 11047 + ... + 26333.
It is an arithmetic number, because the mean of its divisors is an integer number (12383280).
Almost surely, 2285714030 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 285714030, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (396264960).
285714030 is an abundant number, since it is smaller than the sum of its proper divisors (506815890).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
285714030 is a wasteful number, since it uses less digits than its factorization.
285714030 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15393.
The product of its (nonzero) digits is 6720, while the sum is 30.
The square root of 285714030 is about 16903.0775304381. The cubic root of 285714030 is about 658.6335595159.
The spelling of 285714030 in words is "two hundred eighty-five million, seven hundred fourteen thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •