Base | Representation |
---|---|
bin | 10111101001011… |
… | …11001100001001 |
3 | 111211021110011212 |
4 | 23310233030021 |
5 | 401240433103 |
6 | 31403502505 |
7 | 4626103205 |
oct | 1364571411 |
9 | 454243155 |
10 | 198374153 |
11 | a1a8248a |
12 | 56527a35 |
13 | 32138273 |
14 | 1c4bbb05 |
15 | 126377d8 |
hex | bd2f309 |
198374153 has 4 divisors (see below), whose sum is σ = 198669588. Its totient is φ = 198078720.
The previous prime is 198374129. The next prime is 198374161. The reversal of 198374153 is 351473891.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 351473891 = 7549 ⋅46559.
It can be written as a sum of positive squares in 2 ways, for example, as 67683529 + 130690624 = 8227^2 + 11432^2 .
It is a cyclic number.
It is not a de Polignac number, because 198374153 - 212 = 198370057 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 198374153.
It is not an unprimeable number, because it can be changed into a prime (198374753) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 146708 + ... + 148053.
It is an arithmetic number, because the mean of its divisors is an integer number (49667397).
Almost surely, 2198374153 is an apocalyptic number.
It is an amenable number.
198374153 is a deficient number, since it is larger than the sum of its proper divisors (295435).
198374153 is an equidigital number, since it uses as much as digits as its factorization.
198374153 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 295434.
The product of its digits is 90720, while the sum is 41.
The square root of 198374153 is about 14084.5359525971. The cubic root of 198374153 is about 583.2145656072.
The spelling of 198374153 in words is "one hundred ninety-eight million, three hundred seventy-four thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •