Base | Representation |
---|---|
bin | 100101110000… |
… | …1001011101000 |
3 | 1101020202222120 |
4 | 1023201023220 |
5 | 20031443322 |
6 | 1544151240 |
7 | 330161235 |
oct | 113411350 |
9 | 41222876 |
10 | 19796712 |
11 | 101a1621 |
12 | 6768520 |
13 | 4141a40 |
14 | 28b478c |
15 | 1b10a5c |
hex | 12e12e8 |
19796712 has 64 divisors (see below), whose sum is σ = 53887680. Its totient is φ = 6024192.
The previous prime is 19796677. The next prime is 19796713. The reversal of 19796712 is 21769791.
It is a happy number.
It is not an unprimeable number, because it can be changed into a prime (19796713) 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 15 ways as a sum of consecutive naturals, for example, 33088 + ... + 33680.
It is an arithmetic number, because the mean of its divisors is an integer number (841995).
Almost surely, 219796712 is an apocalyptic number.
19796712 is a gapful number since it is divisible by the number (12) 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 19796712, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (26943840).
19796712 is an abundant number, since it is smaller than the sum of its proper divisors (34090968).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
19796712 is a wasteful number, since it uses less digits than its factorization.
19796712 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 722 (or 718 counting only the distinct ones).
The product of its digits is 47628, while the sum is 42.
The square root of 19796712 is about 4449.3496153932. The cubic root of 19796712 is about 270.5189470615.
The spelling of 19796712 in words is "nineteen million, seven hundred ninety-six thousand, seven hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •