Base | Representation |
---|---|
bin | 10111100111101… |
… | …10010011100101 |
3 | 111210211121120101 |
4 | 23303312103211 |
5 | 401211004112 |
6 | 31354504101 |
7 | 4624113004 |
oct | 1363662345 |
9 | 453747511 |
10 | 198141157 |
11 | a1933425 |
12 | 56435031 |
13 | 320861b6 |
14 | 1c45ac3b |
15 | 125dd757 |
hex | bcf64e5 |
198141157 has 4 divisors (see below), whose sum is σ = 198930816. Its totient is φ = 197351500.
The previous prime is 198141131. The next prime is 198141161. The reversal of 198141157 is 751141891.
It is a happy number.
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.
It is a cyclic number.
It is not a de Polignac number, because 198141157 - 27 = 198141029 is a prime.
It is a super-3 number, since 3×1981411573 (a number of 26 digits) contains 333 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (198141107) 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, 394453 + ... + 394954.
It is an arithmetic number, because the mean of its divisors is an integer number (49732704).
Almost surely, 2198141157 is an apocalyptic number.
It is an amenable number.
198141157 is a deficient number, since it is larger than the sum of its proper divisors (789659).
198141157 is an equidigital number, since it uses as much as digits as its factorization.
198141157 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 789658.
The product of its digits is 10080, while the sum is 37.
The square root of 198141157 is about 14076.2621814173. The cubic root of 198141157 is about 582.9861422054.
The spelling of 198141157 in words is "one hundred ninety-eight million, one hundred forty-one thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •