Base | Representation |
---|---|
bin | 110111111011100110… |
… | …0010111011100100101 |
3 | 102111000202122211001212 |
4 | 1233313030113130211 |
5 | 3431442000043414 |
6 | 131102310401205 |
7 | 11451320316620 |
oct | 1576714273445 |
9 | 374022584055 |
10 | 120111331109 |
11 | 46a36795900 |
12 | 1b341060205 |
13 | b432297573 |
14 | 5b56046db7 |
15 | 31ceb4783e |
hex | 1bf7317725 |
120111331109 has 24 divisors (see below), whose sum is σ = 151132875264. Its totient is φ = 93438655200.
The previous prime is 120111331103. The next prime is 120111331111. The reversal of 120111331109 is 901133111021.
It is a happy number.
It is a de Polignac number, because none of the positive numbers 2k-120111331109 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (120111331103) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 397319 + ... + 630939.
It is an arithmetic number, because the mean of its divisors is an integer number (6297203136).
Almost surely, 2120111331109 is an apocalyptic number.
It is an amenable number.
120111331109 is a deficient number, since it is larger than the sum of its proper divisors (31021544155).
120111331109 is a wasteful number, since it uses less digits than its factorization.
120111331109 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 234257 (or 234246 counting only the distinct ones).
The product of its (nonzero) digits is 162, while the sum is 23.
The spelling of 120111331109 in words is "one hundred twenty billion, one hundred eleven million, three hundred thirty-one thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •