Base | Representation |
---|---|
bin | 1011100011111000100… |
… | …1010100010011000001 |
3 | 200222122112212112202221 |
4 | 2320332021110103001 |
5 | 11223223422003231 |
6 | 231123553411041 |
7 | 20230524466021 |
oct | 2707611242301 |
9 | 628575775687 |
10 | 198611125441 |
11 | 77259891193 |
12 | 325aa569a81 |
13 | 15962667601 |
14 | 9881867a81 |
15 | 527657ad11 |
hex | 2e3e2544c1 |
198611125441 has 4 divisors (see below), whose sum is σ = 201125190400. Its totient is φ = 196097060484.
The previous prime is 198611125387. The next prime is 198611125457. The reversal of 198611125441 is 144521116891.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 144521116891 = 1367 ⋅105721373.
It is a cyclic number.
It is not a de Polignac number, because 198611125441 - 27 = 198611125313 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (198611122441) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1257032361 + ... + 1257032518.
It is an arithmetic number, because the mean of its divisors is an integer number (50281297600).
Almost surely, 2198611125441 is an apocalyptic number.
It is an amenable number.
198611125441 is a deficient number, since it is larger than the sum of its proper divisors (2514064959).
198611125441 is an equidigital number, since it uses as much as digits as its factorization.
198611125441 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2514064958.
The product of its digits is 69120, while the sum is 43.
The spelling of 198611125441 in words is "one hundred ninety-eight billion, six hundred eleven million, one hundred twenty-five thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •