Search a number
-
+
489032715642 = 23137967615233
BaseRepresentation
bin1110001110111001001…
…11110000110101111010
31201202021112022221102120
413013130213300311322
531003014333400032
61012354124142110
750221454332362
oct7073447606572
91652245287376
10489032715642
11179441245429
127a940097936
1337166c394c3
141995282b9a2
15cac2da762c
hex71dc9f0d7a

489032715642 has 32 divisors (see below), whose sum is σ = 986225023872. Its totient is φ = 161653438464.

The previous prime is 489032715623. The next prime is 489032715673. The reversal of 489032715642 is 246517230984.

It is an unprimeable number.

It is a pernicious number, because its binary representation contains a prime number (23) of ones.

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 487258 + ... + 1102490.

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

It is a 2-persistent number, because it is pandigital, and so is 2⋅489032715642 = 978065431284, but 3⋅489032715642 = 1467098146926 is not.

Almost surely, 2489032715642 is an apocalyptic number.

489032715642 is an abundant number, since it is smaller than the sum of its proper divisors (497192308230).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

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

The sum of its prime factors is 616342.

The product of its (nonzero) digits is 2903040, while the sum is 51.

The spelling of 489032715642 in words is "four hundred eighty-nine billion, thirty-two million, seven hundred fifteen thousand, six hundred forty-two".

Divisors: 1 2 3 6 137 274 411 822 967 1934 2901 5802 132479 264958 397437 615233 794874 1230466 1845699 3691398 84286921 168573842 252860763 505721526 594930311 1189860622 1784790933 3569581866 81505452607 163010905214 244516357821 489032715642