Base | Representation |
---|---|
bin | 1110001111100101011… |
… | …00000110100001110110 |
3 | 1201210020022222212221210 |
4 | 13013302230012201312 |
5 | 31004244123424143 |
6 | 1012454551422250 |
7 | 50233601311155 |
oct | 7076254064166 |
9 | 1653208885853 |
10 | 489402951798 |
11 | 179611231322 |
12 | 7aa24084986 |
13 | 371c5859457 |
14 | 19989a8559c |
15 | cae563c033 |
hex | 71f2b06876 |
489402951798 has 32 divisors (see below), whose sum is σ = 991002773376. Its totient is φ = 161103109248.
The previous prime is 489402951773. The next prime is 489402951799. The reversal of 489402951798 is 897159204984.
489402951798 is digitally balanced in base 4, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×4894029517982 (a number of 24 digits) contains 22 as substring.
It is a Smith number, since the sum of its digits (66) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (489402951799) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1029390 + ... + 1427742.
It is an arithmetic number, because the mean of its divisors is an integer number (30968836668).
Almost surely, 2489402951798 is an apocalyptic number.
489402951798 is an abundant number, since it is smaller than the sum of its proper divisors (501599821578).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
489402951798 is a wasteful number, since it uses less digits than its factorization.
489402951798 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 400908.
The product of its (nonzero) digits is 52254720, while the sum is 66.
The spelling of 489402951798 in words is "four hundred eighty-nine billion, four hundred two million, nine hundred fifty-one thousand, seven hundred ninety-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •