Base | Representation |
---|---|
bin | 10111101000101… |
… | …01000001010000 |
3 | 111211002000010202 |
4 | 23310111001100 |
5 | 401224020320 |
6 | 31401314332 |
7 | 4625145533 |
oct | 1364250120 |
9 | 454060122 |
10 | 198266960 |
11 | a1a099a1 |
12 | 564959a8 |
13 | 320cb538 |
14 | 1c490a1a |
15 | 12615b75 |
hex | bd15050 |
198266960 has 20 divisors (see below), whose sum is σ = 460970868. Its totient is φ = 79306752.
The previous prime is 198266941. The next prime is 198266983. The reversal of 198266960 is 69662891.
It can be written as a sum of positive squares in 2 ways, for example, as 136235584 + 62031376 = 11672^2 + 7876^2 .
It is a tau number, because it is divible by the number of its divisors (20).
It is a Smith number, since the sum of its digits (47) coincides with the sum of the digits of its prime factors.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1239089 + ... + 1239248.
Almost surely, 2198266960 is an apocalyptic number.
198266960 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
198266960 is an abundant number, since it is smaller than the sum of its proper divisors (262703908).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
198266960 is a wasteful number, since it uses less digits than its factorization.
198266960 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2478350 (or 2478344 counting only the distinct ones).
The product of its (nonzero) digits is 279936, while the sum is 47.
The square root of 198266960 is about 14080.7300947074. The cubic root of 198266960 is about 583.1094985209.
The spelling of 198266960 in words is "one hundred ninety-eight million, two hundred sixty-six thousand, nine hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •