Base | Representation |
---|---|
bin | 101011001110011110101010… |
… | …101011101011110011111011 |
3 | 220221010102201112100220122001 |
4 | 223032132222223223303323 |
5 | 144404234312224014321 |
6 | 1512155442125041431 |
7 | 55021031554611433 |
oct | 5316365253536373 |
9 | 827112645326561 |
10 | 190111001001211 |
11 | 55636693977474 |
12 | 193a49516b6277 |
13 | 821050cb2b384 |
14 | 34d35c8a072c3 |
15 | 16ea354071c91 |
hex | ace7aaaebcfb |
190111001001211 has 4 divisors (see below), whose sum is σ = 190963516700992. Its totient is φ = 189258485301432.
The previous prime is 190111001001209. The next prime is 190111001001217. The reversal of 190111001001211 is 112100100111091.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 190111001001211 - 21 = 190111001001209 is a prime.
It is a super-2 number, since 2×1901110010012112 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (190111001001217) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 426257849556 + ... + 426257850001.
It is an arithmetic number, because the mean of its divisors is an integer number (47740879175248).
Almost surely, 2190111001001211 is an apocalyptic number.
190111001001211 is a deficient number, since it is larger than the sum of its proper divisors (852515699781).
190111001001211 is an equidigital number, since it uses as much as digits as its factorization.
190111001001211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 852515699780.
The product of its (nonzero) digits is 18, while the sum is 19.
The spelling of 190111001001211 in words is "one hundred ninety trillion, one hundred eleven billion, one million, one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •