Base | Representation |
---|---|
bin | 1000110001001111111100… |
… | …00011111111101111110110 |
3 | 2112021120022221120222021122 |
4 | 10120213332003333233312 |
5 | 10011423342341332100 |
6 | 105003041221343542 |
7 | 4030151452645352 |
oct | 430477603775766 |
9 | 75246287528248 |
10 | 19284370652150 |
11 | 616550154403a |
12 | 21b5534867bb2 |
13 | a9b67bac7c96 |
14 | 4a952330a462 |
15 | 23696db00985 |
hex | 1189fe0ffbf6 |
19284370652150 has 144 divisors (see below), whose sum is σ = 38424318686208. Its totient is φ = 7192933104000.
The previous prime is 19284370652101. The next prime is 19284370652203. The reversal of 19284370652150 is 5125607348291.
It is a junction number, because it is equal to n+sod(n) for n = 19284370652092 and 19284370652101.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 655670945 + ... + 655700355.
It is an arithmetic number, because the mean of its divisors is an integer number (266835546432).
It is a 1-persistent number, because it is pandigital, but 2⋅19284370652150 = 38568741304300 is not.
Almost surely, 219284370652150 is an apocalyptic number.
19284370652150 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
19284370652150 is a deficient number, since it is larger than the sum of its proper divisors (19139948034058).
19284370652150 is a wasteful number, since it uses less digits than its factorization.
19284370652150 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30015 (or 29981 counting only the distinct ones).
The product of its (nonzero) digits is 3628800, while the sum is 53.
The spelling of 19284370652150 in words is "nineteen trillion, two hundred eighty-four billion, three hundred seventy million, six hundred fifty-two thousand, one hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •