Base | Representation |
---|---|
bin | 10111010111101… |
… | …11110011010100 |
3 | 111122220101020000 |
4 | 23223313303110 |
5 | 400142101012 |
6 | 31242011300 |
7 | 4600253505 |
oct | 1353676324 |
9 | 448811200 |
10 | 196050132 |
11 | a0735403 |
12 | 557a6b30 |
13 | 318034c5 |
14 | 1c074bac |
15 | 12328ddc |
hex | baf7cd4 |
196050132 has 60 divisors (see below), whose sum is σ = 539505120. Its totient is φ = 61908624.
The previous prime is 196050119. The next prime is 196050133. The reversal of 196050132 is 231050691.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 196050096 and 196050105.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (196050133) by changing a digit.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 9768 + ... + 22079.
It is an arithmetic number, because the mean of its divisors is an integer number (8991752).
Almost surely, 2196050132 is an apocalyptic number.
196050132 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
196050132 is an abundant number, since it is smaller than the sum of its proper divisors (343454988).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
196050132 is a wasteful number, since it uses less digits than its factorization.
196050132 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 31882 (or 31871 counting only the distinct ones).
The product of its (nonzero) digits is 1620, while the sum is 27.
The square root of 196050132 is about 14001.7903140991. The cubic root of 196050132 is about 580.9280939724.
The spelling of 196050132 in words is "one hundred ninety-six million, fifty thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •