Base | Representation |
---|---|
bin | 10111001001010… |
… | …01110001001001 |
3 | 111112100020012202 |
4 | 23210221301021 |
5 | 344201021031 |
6 | 31133245545 |
7 | 4545212156 |
oct | 1344516111 |
9 | 445306182 |
10 | 194157641 |
11 | 9a662567 |
12 | 550338b5 |
13 | 312bcca2 |
14 | 1bb0122d |
15 | 120a32cb |
hex | b929c49 |
194157641 has 2 divisors, whose sum is σ = 194157642. Its totient is φ = 194157640.
The previous prime is 194157577. The next prime is 194157643. The reversal of 194157641 is 146751491.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 184172041 + 9985600 = 13571^2 + 3160^2 .
It is a cyclic number.
It is not a de Polignac number, because 194157641 - 26 = 194157577 is a prime.
It is a Sophie Germain prime.
Together with 194157643, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 194157595 and 194157604.
It is not a weakly prime, because it can be changed into another prime (194157643) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 97078820 + 97078821.
It is an arithmetic number, because the mean of its divisors is an integer number (97078821).
Almost surely, 2194157641 is an apocalyptic number.
It is an amenable number.
194157641 is a deficient number, since it is larger than the sum of its proper divisors (1).
194157641 is an equidigital number, since it uses as much as digits as its factorization.
194157641 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 30240, while the sum is 38.
The square root of 194157641 is about 13934.0461101577. The cubic root of 194157641 is about 579.0527950124.
The spelling of 194157641 in words is "one hundred ninety-four million, one hundred fifty-seven thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •