Base | Representation |
---|---|
bin | 10111101001010… |
… | …01011100000000 |
3 | 111211020020212020 |
4 | 23310221130000 |
5 | 401234204332 |
6 | 31403201440 |
7 | 4625644416 |
oct | 1364513400 |
9 | 454206766 |
10 | 198350592 |
11 | a1a66810 |
12 | 56516280 |
13 | 3212a61b |
14 | 1c4b32b6 |
15 | 1263082c |
hex | bd29700 |
198350592 has 144 divisors (see below), whose sum is σ = 588083328. Its totient is φ = 58839040.
The previous prime is 198350587. The next prime is 198350609. The reversal of 198350592 is 295053891.
198350592 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 447523 + ... + 447965.
It is an arithmetic number, because the mean of its divisors is an integer number (4083912).
Almost surely, 2198350592 is an apocalyptic number.
198350592 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 198350592, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (294041664).
198350592 is an abundant number, since it is smaller than the sum of its proper divisors (389732736).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
198350592 is a wasteful number, since it uses less digits than its factorization.
198350592 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 526 (or 512 counting only the distinct ones).
The product of its (nonzero) digits is 97200, while the sum is 42.
The square root of 198350592 is about 14083.6995139771. The cubic root of 198350592 is about 583.1914751285.
The spelling of 198350592 in words is "one hundred ninety-eight million, three hundred fifty thousand, five hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.110 sec. • engine limits •