Base | Representation |
---|---|
bin | 11011010011110101010101… |
… | …111000001000010010010000 |
3 | 120202021102102102210112112202 |
4 | 123103311111320020102100 |
5 | 111220341143002210000 |
6 | 1103241510435142332 |
7 | 34204450520051531 |
oct | 3323652570102220 |
9 | 522242372715482 |
10 | 120110201210000 |
11 | 352a84a5353381 |
12 | 1157a1b34449a8 |
13 | 5203460515841 |
14 | 2193516c6c688 |
15 | dd451e245dd5 |
hex | 6d3d55e08490 |
120110201210000 has 50 divisors (see below), whose sum is σ = 290798808173742. Its totient is φ = 48044080480000.
The previous prime is 120110201209937. The next prime is 120110201210053. The reversal of 120110201210000 is 12102011021.
It can be written as a sum of positive squares in 5 ways, for example, as 28681723003024 + 91428478206976 = 5355532^2 + 9561824^2 .
It is a tau number, because it is divible by the number of its divisors (50).
It is an unprimeable number.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 6005500061 + ... + 6005520060.
Almost surely, 2120110201210000 is an apocalyptic number.
120110201210000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
120110201210000 is an abundant number, since it is smaller than the sum of its proper divisors (170688606963742).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
120110201210000 is an equidigital number, since it uses as much as digits as its factorization.
120110201210000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12011020149 (or 12011020128 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 120110201210000 its reverse (12102011021), we get a palindrome (120122303221021).
The spelling of 120110201210000 in words is "one hundred twenty trillion, one hundred ten billion, two hundred one million, two hundred ten thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •