Base | Representation |
---|---|
bin | 10001110101110011… |
… | …101000101001100001 |
3 | 1211110001000212100001 |
4 | 101311303220221201 |
5 | 303213010324142 |
6 | 12444510500001 |
7 | 1245466124464 |
oct | 216563505141 |
9 | 54401025301 |
10 | 19156339297 |
11 | 8140288277 |
12 | 3867504601 |
13 | 1a63978c14 |
14 | cda2332db |
15 | 771b6c5b7 |
hex | 475ce8a61 |
19156339297 has 4 divisors (see below), whose sum is σ = 19253579796. Its totient is φ = 19059098800.
The previous prime is 19156339283. The next prime is 19156339333. The reversal of 19156339297 is 79293365191.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 12676733281 + 6479606016 = 112591^2 + 80496^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-19156339297 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (19156339217) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 48619954 + ... + 48620347.
It is an arithmetic number, because the mean of its divisors is an integer number (4813394949).
Almost surely, 219156339297 is an apocalyptic number.
It is an amenable number.
19156339297 is a deficient number, since it is larger than the sum of its proper divisors (97240499).
19156339297 is an equidigital number, since it uses as much as digits as its factorization.
19156339297 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 97240498.
The product of its digits is 2755620, while the sum is 55.
It can be divided in two parts, 191563 and 39297, that added together give a triangular number (230860 = T679).
The spelling of 19156339297 in words is "nineteen billion, one hundred fifty-six million, three hundred thirty-nine thousand, two hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •