Base | Representation |
---|---|
bin | 110111111110100100… |
… | …1000001111110000000 |
3 | 102111021201102121200201 |
4 | 1233331021001332000 |
5 | 3432143021320000 |
6 | 131120233254544 |
7 | 11453641442416 |
oct | 1577511017600 |
9 | 374251377621 |
10 | 120211120000 |
11 | 46a88052764 |
12 | 1b36a564454 |
13 | b449b65c4a |
14 | 5b653c12b6 |
15 | 31d87a996a |
hex | 1bfd241f80 |
120211120000 has 80 divisors (see below), whose sum is σ = 299258269200. Its totient is φ = 48084416000.
The previous prime is 120211119989. The next prime is 120211120019. The reversal of 120211120000 is 21112021.
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 (10).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 671320 + ... + 831319.
It is an arithmetic number, because the mean of its divisors is an integer number (3740728365).
Almost surely, 2120211120000 is an apocalyptic number.
120211120000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
120211120000 is an abundant number, since it is smaller than the sum of its proper divisors (179047149200).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
120211120000 is an frugal number, since it uses more digits than its factorization.
120211120000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1502673 (or 1502646 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 120211120000 its reverse (21112021), we get a palindrome (120232232021).
The spelling of 120211120000 in words is "one hundred twenty billion, two hundred eleven million, one hundred twenty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •