Base | Representation |
---|---|
bin | 1000101001010111111011… |
… | …01001000100111101010100 |
3 | 2111022200220001202221021202 |
4 | 10110223331221010331110 |
5 | 4443010210321442311 |
6 | 104234451002532032 |
7 | 4001462131636232 |
oct | 424537551047524 |
9 | 74280801687252 |
10 | 19013780655956 |
11 | 6070776545a09 |
12 | 2170bb8807018 |
13 | a7bcb80590b8 |
14 | 49a3b4111952 |
15 | 22e8d3376e3b |
hex | 114afda44f54 |
19013780655956 has 24 divisors (see below), whose sum is σ = 33397456014720. Its totient is φ = 9471651537600.
The previous prime is 19013780655953. The next prime is 19013780655959. The reversal of 19013780655956 is 65955608731091.
It is an interprime number because it is at equal distance from previous prime (19013780655953) and next prime (19013780655959).
It is a junction number, because it is equal to n+sod(n) for n = 19013780655892 and 19013780655901.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (19013780655953) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 91093760 + ... + 91302248.
It is an arithmetic number, because the mean of its divisors is an integer number (1391560667280).
Almost surely, 219013780655956 is an apocalyptic number.
It is an amenable number.
19013780655956 is a deficient number, since it is larger than the sum of its proper divisors (14383675358764).
19013780655956 is a wasteful number, since it uses less digits than its factorization.
19013780655956 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 292895 (or 292893 counting only the distinct ones).
The product of its (nonzero) digits is 61236000, while the sum is 65.
The spelling of 19013780655956 in words is "nineteen trillion, thirteen billion, seven hundred eighty million, six hundred fifty-five thousand, nine hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •