Base | Representation |
---|---|
bin | 1011001000010110011… |
… | …0110101001100100001 |
3 | 200021120110101001210111 |
4 | 2302011212311030201 |
5 | 11113104322010423 |
6 | 223502330331321 |
7 | 16546420055254 |
oct | 2620546651441 |
9 | 607513331714 |
10 | 191220110113 |
11 | 74106848a5a |
12 | 31087289b41 |
13 | 15055347766 |
14 | 938000509b |
15 | 4e9277560d |
hex | 2c859b5321 |
191220110113 has 4 divisors (see below), whose sum is σ = 199534027968. Its totient is φ = 182906192260.
The previous prime is 191220110101. The next prime is 191220110143. The reversal of 191220110113 is 311011022191.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 311011022191 = 283 ⋅1098978877.
It is a cyclic number.
It is not a de Polignac number, because 191220110113 - 213 = 191220101921 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (191220110143) 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 3 ways as a sum of consecutive naturals, for example, 4156958893 + ... + 4156958938.
It is an arithmetic number, because the mean of its divisors is an integer number (49883506992).
Almost surely, 2191220110113 is an apocalyptic number.
It is an amenable number.
191220110113 is a deficient number, since it is larger than the sum of its proper divisors (8313917855).
191220110113 is an equidigital number, since it uses as much as digits as its factorization.
191220110113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8313917854.
The product of its (nonzero) digits is 108, while the sum is 22.
The spelling of 191220110113 in words is "one hundred ninety-one billion, two hundred twenty million, one hundred ten thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •