Base | Representation |
---|---|
bin | 1000001010110110110… |
… | …00100111010101110001 |
3 | 222211112212221222210121 |
4 | 10011123120213111301 |
5 | 14044341222202424 |
6 | 332542104530241 |
7 | 26165105041411 |
oct | 4053330472561 |
9 | 884485858717 |
10 | 280706053489 |
11 | a9057281764 |
12 | 4649ba80981 |
13 | 20616802804 |
14 | d82c92c641 |
15 | 747d90dee4 |
hex | 415b627571 |
280706053489 has 9 divisors (see below), whose sum is σ = 283943189793. Its totient is φ = 277505428992.
The previous prime is 280706053427. The next prime is 280706053499. The reversal of 280706053489 is 984350607082.
The square root of 280706053489 is 529817.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 4 ways, for example, as 205195410225 + 75510643264 = 452985^2 + 274792^2 .
It is not a de Polignac number, because 280706053489 - 223 = 280697664881 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (280706053499) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 47150737 + ... + 47156689.
Almost surely, 2280706053489 is an apocalyptic number.
280706053489 is the 529817-th square number.
280706053489 is the 264909-th centered octagonal number.
It is an amenable number.
280706053489 is a deficient number, since it is larger than the sum of its proper divisors (3237136304).
280706053489 is an frugal number, since it uses more digits than its factorization.
280706053489 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12084 (or 6042 counting only the distinct ones).
The product of its (nonzero) digits is 2903040, while the sum is 52.
The spelling of 280706053489 in words is "two hundred eighty billion, seven hundred six million, fifty-three thousand, four hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •