Base | Representation |
---|---|
bin | 110111111110101010… |
… | …0111001110000110000 |
3 | 102111021221021201201010 |
4 | 1233331110321300300 |
5 | 3432144320411422 |
6 | 131120424110520 |
7 | 11454010053552 |
oct | 1577524716060 |
9 | 374257251633 |
10 | 120214232112 |
11 | 46a89888957 |
12 | 1b36b605440 |
13 | b44a6b5630 |
14 | 5b659914d2 |
15 | 31d8bc1b0c |
hex | 1bfd539c30 |
120214232112 has 160 divisors (see below), whose sum is σ = 367351488000. Its totient is φ = 33518555136.
The previous prime is 120214232087. The next prime is 120214232143. The reversal of 120214232112 is 211232412021.
It is a happy number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 52264 + ... + 493112.
It is an arithmetic number, because the mean of its divisors is an integer number (2295946800).
Almost surely, 2120214232112 is an apocalyptic number.
120214232112 is a gapful number since it is divisible by the number (12) 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 120214232112, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (183675744000).
120214232112 is an abundant number, since it is smaller than the sum of its proper divisors (247137255888).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
120214232112 is a wasteful number, since it uses less digits than its factorization.
120214232112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 440915 (or 440909 counting only the distinct ones).
The product of its (nonzero) digits is 384, while the sum is 21.
Adding to 120214232112 its reverse (211232412021), we get a palindrome (331446644133).
The spelling of 120214232112 in words is "one hundred twenty billion, two hundred fourteen million, two hundred thirty-two thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •