Base | Representation |
---|---|
bin | 100100101111… |
… | …1110111110000 |
3 | 1100020212102200 |
4 | 1021133313300 |
5 | 14413021211 |
6 | 1524543200 |
7 | 322524114 |
oct | 111376760 |
9 | 40225380 |
10 | 19267056 |
11 | a96a696 |
12 | 6551b00 |
13 | 3cb7933 |
14 | 27b7744 |
15 | 1a58b56 |
hex | 125fdf0 |
19267056 has 60 divisors (see below), whose sum is σ = 54753192. Its totient is φ = 6323328.
The previous prime is 19267051. The next prime is 19267081. The reversal of 19267056 is 65076291.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a self number, because there is not a number n which added to its sum of digits gives 19267056.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (19267051) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 8650 + ... + 10646.
Almost surely, 219267056 is an apocalyptic number.
19267056 is a gapful number since it is divisible by the number (16) 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 19267056, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (27376596).
19267056 is an abundant number, since it is smaller than the sum of its proper divisors (35486136).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
19267056 is a wasteful number, since it uses less digits than its factorization.
19267056 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2078 (or 2069 counting only the distinct ones).
The product of its (nonzero) digits is 22680, while the sum is 36.
The square root of 19267056 is about 4389.4254749340. The cubic root of 19267056 is about 268.0845504371.
The spelling of 19267056 in words is "nineteen million, two hundred sixty-seven thousand, fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •