Base | Representation |
---|---|
bin | 10001010001011… |
… | …010000110110101 |
3 | 202012021011000102 |
4 | 101101122012311 |
5 | 1043140313203 |
6 | 44430523445 |
7 | 10116025100 |
oct | 2121320665 |
9 | 665234012 |
10 | 289776053 |
11 | 139631046 |
12 | 81066585 |
13 | 4805b328 |
14 | 2a6b1737 |
15 | 1a68e888 |
hex | 1145a1b5 |
289776053 has 6 divisors (see below), whose sum is σ = 337086486. Its totient is φ = 248379432.
The previous prime is 289776041. The next prime is 289776059. The reversal of 289776053 is 350677982.
It can be written as a sum of positive squares in only one way, i.e., 282475249 + 7300804 = 16807^2 + 2702^2 .
It is not a de Polignac number, because 289776053 - 24 = 289776037 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 289775989 and 289776007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (289776059) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 2956850 + ... + 2956947.
It is an arithmetic number, because the mean of its divisors is an integer number (56181081).
Almost surely, 2289776053 is an apocalyptic number.
It is an amenable number.
289776053 is a deficient number, since it is larger than the sum of its proper divisors (47310433).
289776053 is an equidigital number, since it uses as much as digits as its factorization.
289776053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5913811 (or 5913804 counting only the distinct ones).
The product of its (nonzero) digits is 635040, while the sum is 47.
The square root of 289776053 is about 17022.8097856964. The cubic root of 289776053 is about 661.7401682911.
The spelling of 289776053 in words is "two hundred eighty-nine million, seven hundred seventy-six thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •