Base | Representation |
---|---|
bin | 10111110100010… |
… | …10000010100011 |
3 | 111220221122000022 |
4 | 23322022002203 |
5 | 402121413401 |
6 | 31454144055 |
7 | 4644141164 |
oct | 1372120243 |
9 | 456848008 |
10 | 199794851 |
11 | a2862913 |
12 | 56ab202b |
13 | 32514b09 |
14 | 1c76b76b |
15 | 1281871b |
hex | be8a0a3 |
199794851 has 2 divisors, whose sum is σ = 199794852. Its totient is φ = 199794850.
The previous prime is 199794821. The next prime is 199794853. The reversal of 199794851 is 158497991.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-199794851 is a prime.
It is a super-2 number, since 2×1997948512 = 79835964972224402, which contains 22 as substring.
Together with 199794853, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 199794793 and 199794802.
It is not a weakly prime, because it can be changed into another prime (199794853) 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, 99897425 + 99897426.
It is an arithmetic number, because the mean of its divisors is an integer number (99897426).
Almost surely, 2199794851 is an apocalyptic number.
199794851 is a deficient number, since it is larger than the sum of its proper divisors (1).
199794851 is an equidigital number, since it uses as much as digits as its factorization.
199794851 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 816480, while the sum is 53.
The square root of 199794851 is about 14134.8806503628. The cubic root of 199794851 is about 584.6035261316.
The spelling of 199794851 in words is "one hundred ninety-nine million, seven hundred ninety-four thousand, eight hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •