Base | Representation |
---|---|
bin | 111000001101101100… |
… | …1010000010101101000 |
3 | 102112121002111211100021 |
4 | 1300123121100111220 |
5 | 3434212441032030 |
6 | 131242444250224 |
7 | 11502343634323 |
oct | 1603331202550 |
9 | 375532454307 |
10 | 120718689640 |
11 | 4721860a2aa |
12 | 1b490540974 |
13 | b4cb06b603 |
14 | 5bb29877ba |
15 | 321811a97a |
hex | 1c1b650568 |
120718689640 has 96 divisors (see below), whose sum is σ = 287373899520. Its totient is φ = 45553457664.
The previous prime is 120718689551. The next prime is 120718689643. The reversal of 120718689640 is 46986817021.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (120718689643) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 4890369 + ... + 4914991.
It is an arithmetic number, because the mean of its divisors is an integer number (2993478120).
Almost surely, 2120718689640 is an apocalyptic number.
120718689640 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 120718689640, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (143686949760).
120718689640 is an abundant number, since it is smaller than the sum of its proper divisors (166655209880).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
120718689640 is a wasteful number, since it uses less digits than its factorization.
120718689640 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 24803 (or 24726 counting only the distinct ones).
The product of its (nonzero) digits is 1161216, while the sum is 52.
The spelling of 120718689640 in words is "one hundred twenty billion, seven hundred eighteen million, six hundred eighty-nine thousand, six hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •