Base | Representation |
---|---|
bin | 10111100001110… |
… | …00110110100000 |
3 | 111202101012002110 |
4 | 23300320312200 |
5 | 401011141102 |
6 | 31330115320 |
7 | 4614401415 |
oct | 1360706640 |
9 | 452335073 |
10 | 197365152 |
11 | a14533a6 |
12 | 5611bb40 |
13 | 31b73c1a |
14 | 1c2d810c |
15 | 124d886c |
hex | bc38da0 |
197365152 has 48 divisors (see below), whose sum is σ = 519154272. Its totient is φ = 65652480.
The previous prime is 197365043. The next prime is 197365153. The reversal of 197365152 is 251563791.
It is a tau number, because it is divible by the number of its divisors (48).
It is a self number, because there is not a number n which added to its sum of digits gives 197365152.
It is not an unprimeable number, because it can be changed into a prime (197365153) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 51627 + ... + 55317.
It is an arithmetic number, because the mean of its divisors is an integer number (10815714).
Almost surely, 2197365152 is an apocalyptic number.
197365152 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
197365152 is an abundant number, since it is smaller than the sum of its proper divisors (321789120).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
197365152 is a wasteful number, since it uses less digits than its factorization.
197365152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4261 (or 4253 counting only the distinct ones).
The product of its digits is 56700, while the sum is 39.
The square root of 197365152 is about 14048.6708268078. The cubic root of 197365152 is about 582.2240726222.
The spelling of 197365152 in words is "one hundred ninety-seven million, three hundred sixty-five thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •