Base | Representation |
---|---|
bin | 10111100000010… |
… | …00100000110000 |
3 | 111202000010111010 |
4 | 23300020200300 |
5 | 400433322102 |
6 | 31321550520 |
7 | 4612615230 |
oct | 1360104060 |
9 | 452003433 |
10 | 197167152 |
11 | a1328666 |
12 | 56045440 |
13 | 31b04a70 |
14 | 1c285cc0 |
15 | 12499d6c |
hex | bc08830 |
197167152 has 80 divisors (see below), whose sum is σ = 626904320. Its totient is φ = 51998976.
The previous prime is 197167141. The next prime is 197167153. The reversal of 197167152 is 251761791.
It is a super-2 number, since 2×1971671522 = 77749771655582208, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is a self number, because there is not a number n which added to its sum of digits gives 197167152.
It is not an unprimeable number, because it can be changed into a prime (197167153) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 18202 + ... + 26937.
It is an arithmetic number, because the mean of its divisors is an integer number (7836304).
Almost surely, 2197167152 is an apocalyptic number.
197167152 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
197167152 is an abundant number, since it is smaller than the sum of its proper divisors (429737168).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
197167152 is a wasteful number, since it uses less digits than its factorization.
197167152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 45170 (or 45164 counting only the distinct ones).
The product of its digits is 26460, while the sum is 39.
The square root of 197167152 is about 14041.6221285149. The cubic root of 197167152 is about 582.0293085227.
The spelling of 197167152 in words is "one hundred ninety-seven million, one hundred sixty-seven thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •