Base | Representation |
---|---|
bin | 100110100001… |
… | …0110000000000 |
3 | 1102000002012001 |
4 | 1031002300000 |
5 | 20132240402 |
6 | 2000513344 |
7 | 333444331 |
oct | 115026000 |
9 | 42002161 |
10 | 20196352 |
11 | 10444900 |
12 | 691b854 |
13 | 4251907 |
14 | 297a288 |
15 | 1b8e187 |
hex | 1342c00 |
20196352 has 66 divisors (see below), whose sum is σ = 44649164. Its totient is φ = 9123840.
The previous prime is 20196317. The next prime is 20196359. The reversal of 20196352 is 25369102.
It is a self number, because there is not a number n which added to its sum of digits gives 20196352.
It is not an unprimeable number, because it can be changed into a prime (20196359) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 123823 + ... + 123985.
Almost surely, 220196352 is an apocalyptic number.
20196352 is a gapful number since it is divisible by the number (22) 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 20196352, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (22324582).
20196352 is an abundant number, since it is smaller than the sum of its proper divisors (24452812).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20196352 is a wasteful number, since it uses less digits than its factorization.
20196352 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 205 (or 176 counting only the distinct ones).
The product of its (nonzero) digits is 3240, while the sum is 28.
The square root of 20196352 is about 4494.0351578509. The cubic root of 20196352 is about 272.3271726264.
The spelling of 20196352 in words is "twenty million, one hundred ninety-six thousand, three hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •