Base | Representation |
---|---|
bin | 100100111000… |
… | …1101010101110 |
3 | 1100101120102110 |
4 | 1021301222232 |
5 | 14422334300 |
6 | 1530304450 |
7 | 323246460 |
oct | 111615256 |
9 | 40346373 |
10 | 19339950 |
11 | aa0a433 |
12 | 6588126 |
13 | 4011b76 |
14 | 27d6130 |
15 | 1a70550 |
hex | 1271aae |
19339950 has 96 divisors (see below), whose sum is σ = 55639296. Its totient is φ = 4354560.
The previous prime is 19339949. The next prime is 19340029. The reversal of 19339950 is 5993391.
It is a junction number, because it is equal to n+sod(n) for n = 19339899 and 19339908.
It is a congruent number.
It is an unprimeable number.
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 47 ways as a sum of consecutive naturals, for example, 118569 + ... + 118731.
It is an arithmetic number, because the mean of its divisors is an integer number (579576).
Almost surely, 219339950 is an apocalyptic number.
19339950 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 19339950, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (27819648).
19339950 is an abundant number, since it is smaller than the sum of its proper divisors (36299346).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
19339950 is a wasteful number, since it uses less digits than its factorization.
19339950 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 298 (or 293 counting only the distinct ones).
The product of its (nonzero) digits is 32805, while the sum is 39.
The square root of 19339950 is about 4397.7210007002. The cubic root of 19339950 is about 268.4222107844.
The spelling of 19339950 in words is "nineteen million, three hundred thirty-nine thousand, nine hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •