Base | Representation |
---|---|
bin | 110111111011010010… |
… | …1011010110010100111 |
3 | 102111000001110002200202 |
4 | 1233312211122302213 |
5 | 3431431341334231 |
6 | 131101303501115 |
7 | 11451134454242 |
oct | 1576645326247 |
9 | 374001402622 |
10 | 120101121191 |
11 | 46a30a51a57 |
12 | 1b33975779b |
13 | b4301312ac |
14 | 5b5494a259 |
15 | 31cdccc5cb |
hex | 1bf695aca7 |
120101121191 has 2 divisors, whose sum is σ = 120101121192. Its totient is φ = 120101121190.
The previous prime is 120101121169. The next prime is 120101121251. The reversal of 120101121191 is 191121101021.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-120101121191 is a prime.
It is a super-2 number, since 2×1201011211912 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (120101121991) 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 as a sum of consecutive naturals, namely, 60050560595 + 60050560596.
It is an arithmetic number, because the mean of its divisors is an integer number (60050560596).
Almost surely, 2120101121191 is an apocalyptic number.
120101121191 is a deficient number, since it is larger than the sum of its proper divisors (1).
120101121191 is an equidigital number, since it uses as much as digits as its factorization.
120101121191 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 36, while the sum is 20.
The spelling of 120101121191 in words is "one hundred twenty billion, one hundred one million, one hundred twenty-one thousand, one hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.101 sec. • engine limits •