Base | Representation |
---|---|
bin | 1011010101100001100… |
… | …1101111101101110011 |
3 | 200121200221001001011211 |
4 | 2311120121233231303 |
5 | 11142330202003441 |
6 | 225245303220551 |
7 | 20033152254352 |
oct | 2653031575563 |
9 | 617627031154 |
10 | 194756672371 |
11 | 75661078588 |
12 | 318b3747757 |
13 | 15499c45c51 |
14 | 95d799d999 |
15 | 50ecea5a81 |
hex | 2d5866fb73 |
194756672371 has 2 divisors, whose sum is σ = 194756672372. Its totient is φ = 194756672370.
The previous prime is 194756672317. The next prime is 194756672387. The reversal of 194756672371 is 173276657491.
It is a happy number.
Together with previous prime (194756672317) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-194756672371 is a prime.
It is a super-2 number, since 2×1947566723712 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (194756670371) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 97378336185 + 97378336186.
It is an arithmetic number, because the mean of its divisors is an integer number (97378336186).
Almost surely, 2194756672371 is an apocalyptic number.
194756672371 is a deficient number, since it is larger than the sum of its proper divisors (1).
194756672371 is an equidigital number, since it uses as much as digits as its factorization.
194756672371 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 13335840, while the sum is 58.
The spelling of 194756672371 in words is "one hundred ninety-four billion, seven hundred fifty-six million, six hundred seventy-two thousand, three hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •