Base | Representation |
---|---|
bin | 11011110011111100011… |
… | …101010001100110101011 |
3 | 20202201010212212212202211 |
4 | 123303330131101212223 |
5 | 222303114424342024 |
6 | 4021554342305551 |
7 | 255036225363436 |
oct | 33637435214653 |
9 | 6681125785684 |
10 | 1911201012139 |
11 | 677599167a11 |
12 | 26a4a14282b7 |
13 | 10b2c14cc183 |
14 | 687072a681d |
15 | 34aac2db594 |
hex | 1bcfc7519ab |
1911201012139 has 2 divisors, whose sum is σ = 1911201012140. Its totient is φ = 1911201012138.
The previous prime is 1911201012121. The next prime is 1911201012151. The reversal of 1911201012139 is 9312101021191.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1911201012139 - 213 = 1911201003947 is a prime.
It is a super-2 number, since 2×19112010121392 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1911201012139.
It is not a weakly prime, because it can be changed into another prime (1911201012239) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 955600506069 + 955600506070.
It is an arithmetic number, because the mean of its divisors is an integer number (955600506070).
Almost surely, 21911201012139 is an apocalyptic number.
1911201012139 is a deficient number, since it is larger than the sum of its proper divisors (1).
1911201012139 is an equidigital number, since it uses as much as digits as its factorization.
1911201012139 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 972, while the sum is 31.
The spelling of 1911201012139 in words is "one trillion, nine hundred eleven billion, two hundred one million, twelve thousand, one hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •