Base | Representation |
---|---|
bin | 10001000000001… |
… | …110101001000001 |
3 | 201212210100111101 |
4 | 101000032221001 |
5 | 1041012211031 |
6 | 44150214401 |
7 | 10032530443 |
oct | 2100165101 |
9 | 655710441 |
10 | 285272641 |
11 | 137035615 |
12 | 7b654401 |
13 | 471425a4 |
14 | 29c5c493 |
15 | 1a0a0361 |
hex | 1100ea41 |
285272641 has 2 divisors, whose sum is σ = 285272642. Its totient is φ = 285272640.
The previous prime is 285272591. The next prime is 285272671. The reversal of 285272641 is 146272582.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 163942416 + 121330225 = 12804^2 + 11015^2 .
It is a cyclic number.
It is not a de Polignac number, because 285272641 - 219 = 284748353 is a prime.
It is a super-2 number, since 2×2852726412 = 162760959406229762, which contains 22 as substring.
It is a Chen prime.
It is equal to p15496750 and since 285272641 and 15496750 have the same sum of digits, it is a Honaker prime.
It is a self number, because there is not a number n which added to its sum of digits gives 285272641.
It is not a weakly prime, because it can be changed into another prime (285272671) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 142636320 + 142636321.
It is an arithmetic number, because the mean of its divisors is an integer number (142636321).
Almost surely, 2285272641 is an apocalyptic number.
It is an amenable number.
285272641 is a deficient number, since it is larger than the sum of its proper divisors (1).
285272641 is an equidigital number, since it uses as much as digits as its factorization.
285272641 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 53760, while the sum is 37.
The square root of 285272641 is about 16890.0160153861. The cubic root of 285272641 is about 658.2942185310.
The spelling of 285272641 in words is "two hundred eighty-five million, two hundred seventy-two thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •