Base | Representation |
---|---|
bin | 100100011011… |
… | …0010110100000 |
3 | 1022221020011000 |
4 | 1020312112200 |
5 | 14342100432 |
6 | 1521152000 |
7 | 321215235 |
oct | 110662640 |
9 | 38836130 |
10 | 19096992 |
11 | a863942 |
12 | 648b600 |
13 | 3c583c5 |
14 | 277178c |
15 | 1a2357c |
hex | 12365a0 |
19096992 has 144 divisors (see below), whose sum is σ = 60056640. Its totient is φ = 5892480.
The previous prime is 19096991. The next prime is 19096999. The reversal of 19096992 is 29969091.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (144).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (19096991) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 616017 + ... + 616047.
It is an arithmetic number, because the mean of its divisors is an integer number (417060).
Almost surely, 219096992 is an apocalyptic number.
19096992 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 19096992, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (30028320).
19096992 is an abundant number, since it is smaller than the sum of its proper divisors (40959648).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
19096992 is a wasteful number, since it uses less digits than its factorization.
19096992 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 104 (or 59 counting only the distinct ones).
The product of its (nonzero) digits is 78732, while the sum is 45.
The square root of 19096992 is about 4370.0105263031. The cubic root of 19096992 is about 267.2934533925.
The spelling of 19096992 in words is "nineteen million, ninety-six thousand, nine hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •