Base | Representation |
---|---|
bin | 10001111001010010… |
… | …001010001100110001 |
3 | 1211121002210111201001 |
4 | 101321102022030301 |
5 | 303322424011224 |
6 | 12454353042001 |
7 | 1250105010622 |
oct | 217122121461 |
9 | 54532714631 |
10 | 19214672689 |
11 | 81701aaa93 |
12 | 3882b56301 |
13 | 1a72a91414 |
14 | d03c99a49 |
15 | 776d41544 |
hex | 47948a331 |
19214672689 has 3 divisors (see below), whose sum is σ = 19214811307. Its totient is φ = 19214534072.
The previous prime is 19214672677. The next prime is 19214672707. The reversal of 19214672689 is 98627641291.
The square root of 19214672689 is 138617.
It is a perfect power (a square), and thus also a powerful number.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It can be written as a sum of positive squares in only one way, i.e., 13191671025 + 6023001664 = 114855^2 + 77608^2 .
It is a de Polignac number, because none of the positive numbers 2k-19214672689 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (19214672639) by changing a digit.
It is a polite number, since it can be written in 2 ways as a sum of consecutive naturals, for example, 69309 + ... + 207925.
Almost surely, 219214672689 is an apocalyptic number.
19214672689 is the 138617-th square number.
19214672689 is the 69309-th centered octagonal number.
It is an amenable number.
19214672689 is a deficient number, since it is larger than the sum of its proper divisors (138618).
19214672689 is an frugal number, since it uses more digits than its factorization.
19214672689 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 277234 (or 138617 counting only the distinct ones).
The product of its digits is 2612736, while the sum is 55.
The spelling of 19214672689 in words is "nineteen billion, two hundred fourteen million, six hundred seventy-two thousand, six hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •