Base | Representation |
---|---|
bin | 10010000010111001… |
… | …100111011101001111 |
3 | 1212000100101100101021 |
4 | 102002321213131033 |
5 | 304140224323322 |
6 | 12522355055011 |
7 | 1254104243146 |
oct | 220271473517 |
9 | 55010340337 |
10 | 19376011087 |
11 | 8243286a04 |
12 | 3908ba1467 |
13 | 1a9a330124 |
14 | d1b49675d |
15 | 7860b04c7 |
hex | 482e6774f |
19376011087 has 4 divisors (see below), whose sum is σ = 19826616040. Its totient is φ = 18925406136.
The previous prime is 19376011073. The next prime is 19376011097. The reversal of 19376011087 is 78011067391.
It is a happy number.
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 19376011087 - 211 = 19376009039 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (43), and also a Moran number because the ratio is a prime number: 450604909 = 19376011087 / (1 + 9 + 3 + 7 + 6 + 0 + 1 + 1 + 0 + 8 + 7).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (19376011037) 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, 225302412 + ... + 225302497.
It is an arithmetic number, because the mean of its divisors is an integer number (4956654010).
Almost surely, 219376011087 is an apocalyptic number.
19376011087 is a deficient number, since it is larger than the sum of its proper divisors (450604953).
19376011087 is an equidigital number, since it uses as much as digits as its factorization.
19376011087 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 450604952.
The product of its (nonzero) digits is 63504, while the sum is 43.
The spelling of 19376011087 in words is "nineteen billion, three hundred seventy-six million, eleven thousand, eighty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •