Base | Representation |
---|---|
bin | 10111100111011… |
… | …11111101110110 |
3 | 111210210021221122 |
4 | 23303233331312 |
5 | 401204141230 |
6 | 31354143542 |
7 | 4623644210 |
oct | 1363577566 |
9 | 453707848 |
10 | 198115190 |
11 | a1915969 |
12 | 56421bb2 |
13 | 32077430 |
14 | 1c4515b0 |
15 | 125d5be5 |
hex | bceff76 |
198115190 has 128 divisors (see below), whose sum is σ = 461970432. Its totient is φ = 59512320.
The previous prime is 198115133. The next prime is 198115213. The reversal of 198115190 is 91511891.
It is a super-2 number, since 2×1981151902 = 78499257017472200, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (35).
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 198115190.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 2386889 + ... + 2386971.
It is an arithmetic number, because the mean of its divisors is an integer number (3609144).
Almost surely, 2198115190 is an apocalyptic number.
198115190 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
198115190 is an abundant number, since it is smaller than the sum of its proper divisors (263855242).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
198115190 is a wasteful number, since it uses less digits than its factorization.
198115190 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 214.
The product of its (nonzero) digits is 3240, while the sum is 35.
The square root of 198115190 is about 14075.3397827548. The cubic root of 198115190 is about 582.9606737250.
It can be divided in two parts, 1981 and 15190, that added together give a palindrome (17171).
The spelling of 198115190 in words is "one hundred ninety-eight million, one hundred fifteen thousand, one hundred ninety".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •