Base | Representation |
---|---|
bin | 1000101010001101011011… |
… | …01011011101010101000011 |
3 | 2111102110000211120120220001 |
4 | 10111012231223131111003 |
5 | 4443443021442430414 |
6 | 104300001105100431 |
7 | 4003526666155264 |
oct | 425065553352503 |
9 | 74373024516801 |
10 | 19042503873859 |
11 | 6081975aaa724 |
12 | 2176694027717 |
13 | a81914a5521b |
14 | 49b93ab6096b |
15 | 230514d4a074 |
hex | 1151adadd543 |
19042503873859 has 8 divisors (see below), whose sum is σ = 19059177841712. Its totient is φ = 19025832886560.
The previous prime is 19042503873853. The next prime is 19042503873889. The reversal of 19042503873859 is 95837830524091.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 19042503873859 - 227 = 19042369656131 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 19042503873859.
It is not an unprimeable number, because it can be changed into a prime (19042503873853) 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, 12135637 + ... + 13614649.
It is an arithmetic number, because the mean of its divisors is an integer number (2382397230214).
Almost surely, 219042503873859 is an apocalyptic number.
19042503873859 is a deficient number, since it is larger than the sum of its proper divisors (16673967853).
19042503873859 is a wasteful number, since it uses less digits than its factorization.
19042503873859 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1490277.
The product of its (nonzero) digits is 65318400, while the sum is 64.
The spelling of 19042503873859 in words is "nineteen trillion, forty-two billion, five hundred three million, eight hundred seventy-three thousand, eight hundred fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •