Base | Representation |
---|---|
bin | 1110001111001001001… |
… | …11111100011010100010 |
3 | 1201202121212222022120002 |
4 | 13013210213330122202 |
5 | 31003303221341040 |
6 | 1012415322020002 |
7 | 50225004506036 |
oct | 7074447743242 |
9 | 1652555868502 |
10 | 489166980770 |
11 | 17950000a846 |
12 | 7a979047602 |
13 | 371889b9420 |
14 | 199665bc1c6 |
15 | cacea79a15 |
hex | 71e49fc6a2 |
489166980770 has 128 divisors (see below), whose sum is σ = 1005518610432. Its totient is φ = 170089113600.
The previous prime is 489166980761. The next prime is 489166980787. The reversal of 489166980770 is 77089661984.
It is a Harshad number since it is a multiple of its sum of digits (65).
It is a junction number, because it is equal to n+sod(n) for n = 489166980697 and 489166980706.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 25035905 + ... + 25055435.
It is an arithmetic number, because the mean of its divisors is an integer number (7855614144).
Almost surely, 2489166980770 is an apocalyptic number.
489166980770 is an abundant number, since it is smaller than the sum of its proper divisors (516351629662).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
489166980770 is a wasteful number, since it uses less digits than its factorization.
489166980770 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19756.
The product of its (nonzero) digits is 36578304, while the sum is 65.
The spelling of 489166980770 in words is "four hundred eighty-nine billion, one hundred sixty-six million, nine hundred eighty thousand, seven hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •