Base | Representation |
---|---|
bin | 10001110000001111… |
… | …101011011111100001 |
3 | 1211012112110010212021 |
4 | 101300033223133201 |
5 | 303020113341211 |
6 | 12431334501441 |
7 | 1243254030115 |
oct | 216017533741 |
9 | 54175403767 |
10 | 19063027681 |
11 | 80a2644935 |
12 | 3840204881 |
13 | 1a4a537849 |
14 | ccbaa3745 |
15 | 768889771 |
hex | 4703eb7e1 |
19063027681 has 4 divisors (see below), whose sum is σ = 19083031812. Its totient is φ = 19043023552.
The previous prime is 19063027679. The next prime is 19063027721. The reversal of 19063027681 is 18672036091.
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 2303136081 + 16759891600 = 47991^2 + 129460^2 .
It is a cyclic number.
It is not a de Polignac number, because 19063027681 - 21 = 19063027679 is a prime.
It is a super-2 number, since 2×190630276812 (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 (19063037681) 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, 10000636 + ... + 10002541.
It is an arithmetic number, because the mean of its divisors is an integer number (4770757953).
Almost surely, 219063027681 is an apocalyptic number.
It is an amenable number.
19063027681 is a deficient number, since it is larger than the sum of its proper divisors (20004131).
19063027681 is an equidigital number, since it uses as much as digits as its factorization.
19063027681 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20004130.
The product of its (nonzero) digits is 108864, while the sum is 43.
The spelling of 19063027681 in words is "nineteen billion, sixty-three million, twenty-seven thousand, six hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •