Base | Representation |
---|---|
bin | 1110001110111001001… |
… | …11110000110101111010 |
3 | 1201202021112022221102120 |
4 | 13013130213300311322 |
5 | 31003014333400032 |
6 | 1012354124142110 |
7 | 50221454332362 |
oct | 7073447606572 |
9 | 1652245287376 |
10 | 489032715642 |
11 | 179441245429 |
12 | 7a940097936 |
13 | 37166c394c3 |
14 | 1995282b9a2 |
15 | cac2da762c |
hex | 71dc9f0d7a |
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".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •