Base | Representation |
---|---|
bin | 10001000001111… |
… | …010011000110001 |
3 | 201220121202212212 |
4 | 101001322120301 |
5 | 1041120321334 |
6 | 44203501505 |
7 | 10036346222 |
oct | 2101723061 |
9 | 656552785 |
10 | 285713969 |
11 | 137307152 |
12 | 7b827895 |
13 | 47268428 |
14 | 29d35249 |
15 | 1a13aece |
hex | 1107a631 |
285713969 has 4 divisors (see below), whose sum is σ = 286689396. Its totient is φ = 284738544.
The previous prime is 285713959. The next prime is 285713983. The reversal of 285713969 is 969317582.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 146119744 + 139594225 = 12088^2 + 11815^2 .
It is a cyclic number.
It is not a de Polignac number, because 285713969 - 212 = 285709873 is a prime.
It is a super-2 number, since 2×2857139692 = 163264944163465922, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (285713959) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 487274 + ... + 487859.
It is an arithmetic number, because the mean of its divisors is an integer number (71672349).
Almost surely, 2285713969 is an apocalyptic number.
It is an amenable number.
285713969 is a deficient number, since it is larger than the sum of its proper divisors (975427).
285713969 is an equidigital number, since it uses as much as digits as its factorization.
285713969 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 975426.
The product of its digits is 816480, while the sum is 50.
The square root of 285713969 is about 16903.0757260328. The cubic root of 285713969 is about 658.6335126431.
It can be divided in two parts, 285713 and 969, that added together give a palindrome (286682).
The spelling of 285713969 in words is "two hundred eighty-five million, seven hundred thirteen thousand, nine hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •