Base | Representation |
---|---|
bin | 10001000000011… |
… | …111010000001001 |
3 | 201212220210211101 |
4 | 101000133100021 |
5 | 1041021400211 |
6 | 44151501401 |
7 | 10033233013 |
oct | 2100372011 |
9 | 655823741 |
10 | 285340681 |
11 | 13708174a |
12 | 7b687861 |
13 | 47167552 |
14 | 29c791b3 |
15 | 1a0b55c1 |
hex | 1101f409 |
285340681 has 2 divisors, whose sum is σ = 285340682. Its totient is φ = 285340680.
The previous prime is 285340673. The next prime is 285340703. The reversal of 285340681 is 186043582.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 150896656 + 134444025 = 12284^2 + 11595^2 .
It is a cyclic number.
It is not a de Polignac number, because 285340681 - 23 = 285340673 is a prime.
It is a super-2 number, since 2×2853406812 = 162838608467087522, which contains 22 as substring.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 285340681.
It is not a weakly prime, because it can be changed into another prime (285344681) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 142670340 + 142670341.
It is an arithmetic number, because the mean of its divisors is an integer number (142670341).
Almost surely, 2285340681 is an apocalyptic number.
It is an amenable number.
285340681 is a deficient number, since it is larger than the sum of its proper divisors (1).
285340681 is an equidigital number, since it uses as much as digits as its factorization.
285340681 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 46080, while the sum is 37.
The square root of 285340681 is about 16892.0301029805. The cubic root of 285340681 is about 658.3465506649.
It can be divided in two parts, 2853 and 40681, that added together give a palindrome (43534).
The spelling of 285340681 in words is "two hundred eighty-five million, three hundred forty thousand, six hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •