Base | Representation |
---|---|
bin | 10001110011010101… |
… | …010111111001001001 |
3 | 1211100010222002100021 |
4 | 101303111113321021 |
5 | 303121400230123 |
6 | 12440425340441 |
7 | 1244453363143 |
oct | 216325277111 |
9 | 54303862307 |
10 | 19114851913 |
11 | 8119921183 |
12 | 3855637721 |
13 | 1a581b1381 |
14 | cd4913c93 |
15 | 76d1c4c5d |
hex | 473557e49 |
19114851913 has 8 divisors (see below), whose sum is σ = 19528908840. Its totient is φ = 18705223680.
The previous prime is 19114851911. The next prime is 19114851947. The reversal of 19114851913 is 31915841191.
It can be written as a sum of positive squares in 4 ways, for example, as 907937424 + 18206914489 = 30132^2 + 134933^2 .
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 19114851913 - 21 = 19114851911 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 19114851913.
It is not an unprimeable number, because it can be changed into a prime (19114851911) 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 7 ways as a sum of consecutive naturals, for example, 1098448 + ... + 1115713.
It is an arithmetic number, because the mean of its divisors is an integer number (2441113605).
Almost surely, 219114851913 is an apocalyptic number.
It is an amenable number.
19114851913 is a deficient number, since it is larger than the sum of its proper divisors (414056927).
19114851913 is an equidigital number, since it uses as much as digits as its factorization.
19114851913 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2214347.
The product of its digits is 38880, while the sum is 43.
The spelling of 19114851913 in words is "nineteen billion, one hundred fourteen million, eight hundred fifty-one thousand, nine hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •