Base | Representation |
---|---|
bin | 110111111010011010… |
… | …1001100010111110000 |
3 | 102110221000002110011002 |
4 | 1233310311030113300 |
5 | 3431401323431000 |
6 | 131054333141132 |
7 | 11450326425065 |
oct | 1576465142760 |
9 | 373830073132 |
10 | 120071702000 |
11 | 46a16388978 |
12 | 1b32b92a7a8 |
13 | b4270007a3 |
14 | 5b50a8cc6c |
15 | 31cb41a8d5 |
hex | 1bf4d4c5f0 |
120071702000 has 80 divisors (see below), whose sum is σ = 290474842944. Its totient is φ = 48005280000.
The previous prime is 120071701999. The next prime is 120071702011. The reversal of 120071702000 is 207170021.
It is a tau number, because it is divible by the number of its divisors (80).
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4428485 + ... + 4455515.
Almost surely, 2120071702000 is an apocalyptic number.
120071702000 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 120071702000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (145237421472).
120071702000 is an abundant number, since it is smaller than the sum of its proper divisors (170403140944).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
120071702000 is a wasteful number, since it uses less digits than its factorization.
120071702000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29275 (or 29259 counting only the distinct ones).
The product of its (nonzero) digits is 196, while the sum is 20.
Adding to 120071702000 its reverse (207170021), we get a palindrome (120278872021).
The spelling of 120071702000 in words is "one hundred twenty billion, seventy-one million, seven hundred two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •