Base | Representation |
---|---|
bin | 1011100100011011010… |
… | …1101011111100100001 |
3 | 201000000201022102220002 |
4 | 2321012311223330201 |
5 | 11224023241134434 |
6 | 231150243425345 |
7 | 20234245256402 |
oct | 2710665537441 |
9 | 630021272802 |
10 | 198756974369 |
11 | 77324148698 |
12 | 3262b385255 |
13 | 15986941c55 |
14 | 9896d919a9 |
15 | 528428a57e |
hex | 2e46d6bf21 |
198756974369 has 2 divisors, whose sum is σ = 198756974370. Its totient is φ = 198756974368.
The previous prime is 198756974357. The next prime is 198756974371. The reversal of 198756974369 is 963479657891.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 117178189969 + 81578784400 = 342313^2 + 285620^2 .
It is a cyclic number.
It is not a de Polignac number, because 198756974369 - 212 = 198756970273 is a prime.
It is a super-2 number, since 2×1987569743692 (a number of 23 digits) contains 22 as substring.
Together with 198756974371, 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 = 198756974296 and 198756974305.
It is not a weakly prime, because it can be changed into another prime (198756974309) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 99378487184 + 99378487185.
It is an arithmetic number, because the mean of its divisors is an integer number (99378487185).
Almost surely, 2198756974369 is an apocalyptic number.
It is an amenable number.
198756974369 is a deficient number, since it is larger than the sum of its proper divisors (1).
198756974369 is an equidigital number, since it uses as much as digits as its factorization.
198756974369 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 617258880, while the sum is 74.
The spelling of 198756974369 in words is "one hundred ninety-eight billion, seven hundred fifty-six million, nine hundred seventy-four thousand, three hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •