193158 has 48 divisors (see below), whose sum is σ = 506160. Its totient is φ = 54432.
The previous prime is 193153. The next prime is 193163. The reversal of 193158 is 851391.
193158 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (193153) and next prime (193163).
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (193153) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 2610 + ... + 2682.
It is an arithmetic number, because the mean of its divisors is an integer number (10545).
2193158 is an apocalyptic number.
193158 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 193158, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (253080).
193158 is an abundant number, since it is smaller than the sum of its proper divisors (313002).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
193158 is a wasteful number, since it uses less digits than its factorization.
193158 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 98 (or 85 counting only the distinct ones).
The product of its digits is 1080, while the sum is 27.
The square root of 193158 is about 439.4974402656. The cubic root of 193158 is about 57.8057313235.
Subtracting from 193158 its sum of digits (27), we obtain a triangular number (193131 = T621).
It can be divided in two parts, 193 and 158, that added together give a triangular number (351 = T26).
The spelling of 193158 in words is "one hundred ninety-three thousand, one hundred fifty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •