Base | Representation |
---|---|
bin | 1110011000101… |
… | …10000111111100 |
3 | 22102002000112100 |
4 | 13030112013330 |
5 | 221343124420 |
6 | 15550305100 |
7 | 2663510403 |
oct | 714260774 |
9 | 272060470 |
10 | 120676860 |
11 | 62134347 |
12 | 344b8190 |
13 | 1c003035 |
14 | 1205463a |
15 | a8db190 |
hex | 73161fc |
120676860 has 144 divisors (see below), whose sum is σ = 387039744. Its totient is φ = 30374784.
The previous prime is 120676819. The next prime is 120676873. The reversal of 120676860 is 68676021.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 426279 + ... + 426561.
It is an arithmetic number, because the mean of its divisors is an integer number (2687776).
Almost surely, 2120676860 is an apocalyptic number.
120676860 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 120676860, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (193519872).
120676860 is an abundant number, since it is smaller than the sum of its proper divisors (266362884).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
120676860 is a wasteful number, since it uses less digits than its factorization.
120676860 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 424 (or 419 counting only the distinct ones).
The product of its (nonzero) digits is 24192, while the sum is 36.
The square root of 120676860 is about 10985.3019985797. The cubic root of 120676860 is about 494.1680546314.
The spelling of 120676860 in words is "one hundred twenty million, six hundred seventy-six thousand, eight hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •