Base | Representation |
---|---|
bin | 100100110101… |
… | …1110111100000 |
3 | 1100100100211112 |
4 | 1021223313200 |
5 | 14421104232 |
6 | 1530002452 |
7 | 323120300 |
oct | 111536740 |
9 | 40310745 |
10 | 19316192 |
11 | a9a35a5 |
12 | 6576428 |
13 | 40040cc |
14 | 27cb600 |
15 | 1a684b2 |
hex | 126bde0 |
19316192 has 72 divisors (see below), whose sum is σ = 45045504. Its totient is φ = 8128512.
The previous prime is 19316191. The next prime is 19316197. The reversal of 19316192 is 29161391.
It is a Harshad number since it is a multiple of its sum of digits (32).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (19316191) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 152033 + ... + 152159.
It is an arithmetic number, because the mean of its divisors is an integer number (625632).
Almost surely, 219316192 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 19316192, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (22522752).
19316192 is an abundant number, since it is smaller than the sum of its proper divisors (25729312).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
19316192 is a wasteful number, since it uses less digits than its factorization.
19316192 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 248 (or 233 counting only the distinct ones).
The product of its digits is 2916, while the sum is 32.
The square root of 19316192 is about 4395.0189988213. The cubic root of 19316192 is about 268.3122520720.
The spelling of 19316192 in words is "nineteen million, three hundred sixteen thousand, one hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •