Base | Representation |
---|---|
bin | 10000110010011… |
… | …110110111100001 |
3 | 201122000021100111 |
4 | 100302132313201 |
5 | 1034101402324 |
6 | 43541051321 |
7 | 6660101452 |
oct | 2062366741 |
9 | 648007314 |
10 | 281669089 |
11 | 134aa4179 |
12 | 7a3b6b41 |
13 | 46480300 |
14 | 295a1129 |
15 | 19adc794 |
hex | 10c9ede1 |
281669089 has 9 divisors (see below), whose sum is σ = 305239059. Its totient is φ = 259800840.
The previous prime is 281669077. The next prime is 281669099. The reversal of 281669089 is 980966182.
It is a happy number.
The square root of 281669089 is 16783.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 41667025 + 240002064 = 6455^2 + 15492^2 .
It is not a de Polignac number, because 281669089 - 29 = 281668577 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (281669099) by changing a digit.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 217534 + ... + 218824.
It is an arithmetic number, because the mean of its divisors is an integer number (33915451).
Almost surely, 2281669089 is an apocalyptic number.
281669089 is the 16783-rd square number.
281669089 is the 8392-nd centered octagonal number.
It is an amenable number.
281669089 is a deficient number, since it is larger than the sum of its proper divisors (23569970).
281669089 is an frugal number, since it uses more digits than its factorization.
281669089 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2608 (or 1304 counting only the distinct ones).
The product of its (nonzero) digits is 373248, while the sum is 49.
The cubic root of 281669089 is about 655.5106163466.
Multiplying 281669089 by its sum of digits (49), we get a square (13801785361 = 1174812).
The spelling of 281669089 in words is "two hundred eighty-one million, six hundred sixty-nine thousand, eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •