Base | Representation |
---|---|
bin | 110111111000010010… |
… | …0000110000110100011 |
3 | 102110202000101020202222 |
4 | 1233300210012012203 |
5 | 3431230012023021 |
6 | 131043254501255 |
7 | 11445500054024 |
oct | 1576044060643 |
9 | 373660336688 |
10 | 120000111011 |
11 | 46989a30570 |
12 | 1b30b96482b |
13 | b415225a61 |
14 | 5b45374c4b |
15 | 31c4ec86ab |
hex | 1bf09061a3 |
120000111011 has 32 divisors (see below), whose sum is σ = 134430333696. Its totient is φ = 106199280000.
The previous prime is 120000110999. The next prime is 120000111019. The reversal of 120000111011 is 110111000021.
It is a happy number.
It is a de Polignac number, because none of the positive numbers 2k-120000111011 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 120000111011.
It is not an unprimeable number, because it can be changed into a prime (120000111019) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 51434801 + ... + 51437133.
It is an arithmetic number, because the mean of its divisors is an integer number (4200947928).
Almost surely, 2120000111011 is an apocalyptic number.
120000111011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
120000111011 is a deficient number, since it is larger than the sum of its proper divisors (14430222685).
120000111011 is a wasteful number, since it uses less digits than its factorization.
120000111011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3203.
The product of its (nonzero) digits is 2, while the sum is 8.
Adding to 120000111011 its reverse (110111000021), we get a palindrome (230111111032).
The spelling of 120000111011 in words is "one hundred twenty billion, one hundred eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •