Base | Representation |
---|---|
bin | 10111001111001… |
… | …01101000100101 |
3 | 111120210022202202 |
4 | 23213211220211 |
5 | 344400132031 |
6 | 31201544245 |
7 | 4554565463 |
oct | 1347455045 |
9 | 446708682 |
10 | 194927141 |
11 | a0038712 |
12 | 55345085 |
13 | 314cc306 |
14 | 1bc61833 |
15 | 121a62cb |
hex | b9e5a25 |
194927141 has 4 divisors (see below), whose sum is σ = 194980800. Its totient is φ = 194873484.
The previous prime is 194927129. The next prime is 194927153. The reversal of 194927141 is 141729491.
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.
It is an interprime number because it is at equal distance from previous prime (194927129) and next prime (194927153).
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-194927141 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 194927095 and 194927104.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (194927111) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 20951 + ... + 28788.
It is an arithmetic number, because the mean of its divisors is an integer number (48745200).
Almost surely, 2194927141 is an apocalyptic number.
It is an amenable number.
194927141 is a deficient number, since it is larger than the sum of its proper divisors (53659).
194927141 is an equidigital number, since it uses as much as digits as its factorization.
194927141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 53658.
The product of its digits is 18144, while the sum is 38.
The square root of 194927141 is about 13961.6310293604. The cubic root of 194927141 is about 579.8167683191.
The spelling of 194927141 in words is "one hundred ninety-four million, nine hundred twenty-seven thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •