Base | Representation |
---|---|
bin | 10111011000010… |
… | …10000111000000 |
3 | 111200001012002100 |
4 | 23230022013000 |
5 | 400202000440 |
6 | 31243350400 |
7 | 4601015232 |
oct | 1354120700 |
9 | 450035070 |
10 | 196125120 |
11 | a0786784 |
12 | 55822400 |
13 | 3182b689 |
14 | 1c094252 |
15 | 12341230 |
hex | bb0a1c0 |
196125120 has 84 divisors (see below), whose sum is σ = 674598600. Its totient is φ = 52299264.
The previous prime is 196125119. The next prime is 196125121. The reversal of 196125120 is 21521691.
It is an interprime number because it is at equal distance from previous prime (196125119) and next prime (196125121).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (196125121) by changing a digit.
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 11 ways as a sum of consecutive naturals, for example, 31170 + ... + 36929.
Almost surely, 2196125120 is an apocalyptic number.
196125120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
196125120 is an abundant number, since it is smaller than the sum of its proper divisors (478473480).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
196125120 is a wasteful number, since it uses less digits than its factorization.
196125120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 68122 (or 68109 counting only the distinct ones).
The product of its (nonzero) digits is 1080, while the sum is 27.
The square root of 196125120 is about 14004.4678585086. The cubic root of 196125120 is about 581.0021517019.
It can be divided in two parts, 196 and 125120, that added together give a square (125316 = 3542).
The spelling of 196125120 in words is "one hundred ninety-six million, one hundred twenty-five thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •