Base | Representation |
---|---|
bin | 10000101101111… |
… | …111110000000001 |
3 | 201112210112010202 |
4 | 100231333300001 |
5 | 1033301234212 |
6 | 43455534545 |
7 | 6644103005 |
oct | 2055776001 |
9 | 645715122 |
10 | 280493057 |
11 | 134370649 |
12 | 79b2a455 |
13 | 4615ac30 |
14 | 29376705 |
15 | 199590c2 |
hex | 10b7fc01 |
280493057 has 8 divisors (see below), whose sum is σ = 305184936. Its totient is φ = 256246272.
The previous prime is 280493051. The next prime is 280493069. The reversal of 280493057 is 750394082.
It can be written as a sum of positive squares in 4 ways, for example, as 633616 + 279859441 = 796^2 + 16729^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 280493057 - 218 = 280230913 is a prime.
It is a super-3 number, since 3×2804930573 (a number of 26 digits) contains 333 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 280493057.
It is not an unprimeable number, because it can be changed into a prime (280493051) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 109958 + ... + 112479.
It is an arithmetic number, because the mean of its divisors is an integer number (38148117).
Almost surely, 2280493057 is an apocalyptic number.
It is an amenable number.
280493057 is a deficient number, since it is larger than the sum of its proper divisors (24691879).
280493057 is a wasteful number, since it uses less digits than its factorization.
280493057 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 222547.
The product of its (nonzero) digits is 60480, while the sum is 38.
The square root of 280493057 is about 16747.9269463417. The cubic root of 280493057 is about 654.5970421292.
The spelling of 280493057 in words is "two hundred eighty million, four hundred ninety-three thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •