Base | Representation |
---|---|
bin | 101101010111100001100011… |
… | …100101000101100111100101 |
3 | 222011110202101011122211120102 |
4 | 231113201203211011213211 |
5 | 202123034204332312301 |
6 | 1544210112313113445 |
7 | 60012320324131232 |
oct | 5527414345054745 |
9 | 864422334584512 |
10 | 199528671369701 |
11 | 586376a8317313 |
12 | 1a465bb03b8885 |
13 | 874461c18582b |
14 | 373b34c5d4789 |
15 | 18102ea5dbb6b |
hex | b578639459e5 |
199528671369701 has 2 divisors, whose sum is σ = 199528671369702. Its totient is φ = 199528671369700.
The previous prime is 199528671369649. The next prime is 199528671369739. The reversal of 199528671369701 is 107963176825991.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 167835937432801 + 31692733936900 = 12955151^2 + 5629630^2 .
It is an emirp because it is prime and its reverse (107963176825991) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 199528671369701 - 242 = 195130624858597 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (199528671365701) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 99764335684850 + 99764335684851.
It is an arithmetic number, because the mean of its divisors is an integer number (99764335684851).
Almost surely, 2199528671369701 is an apocalyptic number.
It is an amenable number.
199528671369701 is a deficient number, since it is larger than the sum of its proper divisors (1).
199528671369701 is an equidigital number, since it uses as much as digits as its factorization.
199528671369701 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 308629440, while the sum is 74.
The spelling of 199528671369701 in words is "one hundred ninety-nine trillion, five hundred twenty-eight billion, six hundred seventy-one million, three hundred sixty-nine thousand, seven hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •