Search a number
-
+
489301682531 = 2321273986197
BaseRepresentation
bin1110001111011001010…
…01110010100101100011
31201202222021102212122012
413013230221302211203
531004042212320111
61012440533103135
750231231451404
oct7075451624543
91652867385565
10489301682531
1117956a053212
127a9b6187aab
13371aa88cccc
141997a4439ab
15cadb7d648b
hex71eca72963

489301682531 has 4 divisors (see below), whose sum is σ = 510575668752. Its totient is φ = 468027696312.

The previous prime is 489301682509. The next prime is 489301682549. The reversal of 489301682531 is 135286103984.

It is a happy number.

It is a semiprime because it is the product of two primes.

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-489301682531 is a prime.

It is a super-2 number, since 2×4893016825312 (a number of 24 digits) contains 22 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 489301682531.

It is not an unprimeable number, because it can be changed into a prime (489301682591) by changing a digit.

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 10636993076 + ... + 10636993121.

It is an arithmetic number, because the mean of its divisors is an integer number (127643917188).

Almost surely, 2489301682531 is an apocalyptic number.

489301682531 is a deficient number, since it is larger than the sum of its proper divisors (21273986221).

489301682531 is a wasteful number, since it uses less digits than its factorization.

489301682531 is an odious number, because the sum of its binary digits is odd.

The sum of its prime factors is 21273986220.

The product of its (nonzero) digits is 1244160, while the sum is 50.

The spelling of 489301682531 in words is "four hundred eighty-nine billion, three hundred one million, six hundred eighty-two thousand, five hundred thirty-one".

Divisors: 1 23 21273986197 489301682531