Base | Representation |
---|---|
bin | 1000101001111001000110… |
… | …00000100010100110011011 |
3 | 2111101101212001100221001102 |
4 | 10110330203000202212123 |
5 | 4443303142340322414 |
6 | 104250553543542015 |
7 | 4002662323020551 |
oct | 424744300424633 |
9 | 74341761327042 |
10 | 19031587432859 |
11 | 6078283a53a61 |
12 | 217454815a90b |
13 | a80895235b91 |
14 | 49b1c3001bd1 |
15 | 2300c67b3ede |
hex | 114f2302299b |
19031587432859 has 4 divisors (see below), whose sum is σ = 19037405714160. Its totient is φ = 19025769151560.
The previous prime is 19031587432831. The next prime is 19031587432889. The reversal of 19031587432859 is 95823478513091.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 19031587432859 - 232 = 19027292465563 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 19031587432795 and 19031587432804.
It is not an unprimeable number, because it can be changed into a prime (19031587432889) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2909135744 + ... + 2909142285.
It is an arithmetic number, because the mean of its divisors is an integer number (4759351428540).
Almost surely, 219031587432859 is an apocalyptic number.
19031587432859 is a deficient number, since it is larger than the sum of its proper divisors (5818281301).
19031587432859 is an equidigital number, since it uses as much as digits as its factorization.
19031587432859 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5818281300.
The product of its (nonzero) digits is 65318400, while the sum is 65.
The spelling of 19031587432859 in words is "nineteen trillion, thirty-one billion, five hundred eighty-seven million, four hundred thirty-two thousand, eight hundred fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •