Base | Representation |
---|---|
bin | 10110110010101… |
… | …10101101101101 |
3 | 111022202202121211 |
4 | 23121112231231 |
5 | 342421233023 |
6 | 30545554421 |
7 | 4511065531 |
oct | 1331265555 |
9 | 438682554 |
10 | 191196013 |
11 | 98a1a438 |
12 | 54045a11 |
13 | 307c3c48 |
14 | 1b56dbc1 |
15 | 11bbaa0d |
hex | b656b6d |
191196013 has 4 divisors (see below), whose sum is σ = 192413980. Its totient is φ = 189978048.
The previous prime is 191196011. The next prime is 191196067. The reversal of 191196013 is 310691191.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 310691191 = 401 ⋅774791.
It can be written as a sum of positive squares in 2 ways, for example, as 128754409 + 62441604 = 11347^2 + 7902^2 .
It is a cyclic number.
It is not a de Polignac number, because 191196013 - 21 = 191196011 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (191196011) 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, 608748 + ... + 609061.
It is an arithmetic number, because the mean of its divisors is an integer number (48103495).
Almost surely, 2191196013 is an apocalyptic number.
It is an amenable number.
191196013 is a deficient number, since it is larger than the sum of its proper divisors (1217967).
191196013 is a wasteful number, since it uses less digits than its factorization.
191196013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1217966.
The product of its (nonzero) digits is 1458, while the sum is 31.
The square root of 191196013 is about 13827.3646440672. The cubic root of 191196013 is about 576.0934585443.
The spelling of 191196013 in words is "one hundred ninety-one million, one hundred ninety-six thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •