Base | Representation |
---|---|
bin | 10111010000100… |
… | …01100110000000 |
3 | 111121010110202121 |
4 | 23220101212000 |
5 | 344421412300 |
6 | 31205454024 |
7 | 4556245441 |
oct | 1350214600 |
9 | 447113677 |
10 | 195107200 |
11 | a0150a22 |
12 | 55411314 |
13 | 31563262 |
14 | 1bcab2c8 |
15 | 121de81a |
hex | ba11980 |
195107200 has 96 divisors (see below), whose sum is σ = 507501000. Its totient is φ = 73912320.
The previous prime is 195107177. The next prime is 195107207. The reversal of 195107200 is 2701591.
It is a Harshad number since it is a multiple of its sum of digits (25).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (195107207) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 59196 + ... + 62404.
Almost surely, 2195107200 is an apocalyptic number.
195107200 is a gapful number since it is divisible by the number (10) 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 195107200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (253750500).
195107200 is an abundant number, since it is smaller than the sum of its proper divisors (312393800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
195107200 is a wasteful number, since it uses less digits than its factorization.
195107200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3252 (or 3235 counting only the distinct ones).
The product of its (nonzero) digits is 630, while the sum is 25.
The square root of 195107200 is about 13968.0778921081. The cubic root of 195107200 is about 579.9952437184.
Adding to 195107200 its reverse (2701591), we get a palindrome (197808791).
The spelling of 195107200 in words is "one hundred ninety-five million, one hundred seven thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •