Base | Representation |
---|---|
bin | 10111011001110… |
… | …11010000100110 |
3 | 111200102102020120 |
4 | 23230323100212 |
5 | 400224421223 |
6 | 31251542410 |
7 | 4602514200 |
oct | 1354732046 |
9 | 450372216 |
10 | 196326438 |
11 | a0903a60 |
12 | 558baa06 |
13 | 3189c1b9 |
14 | 1c107770 |
15 | 12380be3 |
hex | bb3b426 |
196326438 has 96 divisors (see below), whose sum is σ = 527741568. Its totient is φ = 47980800.
The previous prime is 196326437. The next prime is 196326451. The reversal of 196326438 is 834623691.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a self number, because there is not a number n which added to its sum of digits gives 196326438.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (196326437) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 53193 + ... + 56763.
It is an arithmetic number, because the mean of its divisors is an integer number (5497308).
Almost surely, 2196326438 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 196326438, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (263870784).
196326438 is an abundant number, since it is smaller than the sum of its proper divisors (331415130).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
196326438 is a wasteful number, since it uses less digits than its factorization.
196326438 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3618 (or 3611 counting only the distinct ones).
The product of its digits is 186624, while the sum is 42.
The square root of 196326438 is about 14011.6536497303. The cubic root of 196326438 is about 581.2008789105.
The spelling of 196326438 in words is "one hundred ninety-six million, three hundred twenty-six thousand, four hundred thirty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •