Base | Representation |
---|---|
bin | 10001110011100111… |
… | …011001000101100001 |
3 | 1211100110212001201222 |
4 | 101303213121011201 |
5 | 303124102403033 |
6 | 12441114504425 |
7 | 1244541465212 |
oct | 216347310541 |
9 | 54313761658 |
10 | 19119575393 |
11 | 8121557a86 |
12 | 3857135115 |
13 | 1a59176329 |
14 | cd53c3409 |
15 | 76d809598 |
hex | 4739d9161 |
19119575393 has 4 divisors (see below), whose sum is σ = 19119919380. Its totient is φ = 19119231408.
The previous prime is 19119575369. The next prime is 19119575411. The reversal of 19119575393 is 39357591191.
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 2335595584 + 16783979809 = 48328^2 + 129553^2 .
It is a cyclic number.
It is not a de Polignac number, because 19119575393 - 224 = 19102798177 is a prime.
It is a super-2 number, since 2×191195753932 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (19119575093) 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, 67430 + ... + 206847.
It is an arithmetic number, because the mean of its divisors is an integer number (4779979845).
Almost surely, 219119575393 is an apocalyptic number.
It is an amenable number.
19119575393 is a deficient number, since it is larger than the sum of its proper divisors (343987).
19119575393 is an equidigital number, since it uses as much as digits as its factorization.
19119575393 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 343986.
The product of its digits is 1148175, while the sum is 53.
The spelling of 19119575393 in words is "nineteen billion, one hundred nineteen million, five hundred seventy-five thousand, three hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •