Base | Representation |
---|---|
bin | 10010011011100010… |
… | …010111100101011001 |
3 | 1220002011010222212202 |
4 | 102123202113211121 |
5 | 311012033102121 |
6 | 13031402215545 |
7 | 1300253450453 |
oct | 223342274531 |
9 | 56064128782 |
10 | 19789347161 |
11 | 8435630471 |
12 | 3a034b45b5 |
13 | 1b34b6089c |
14 | d5a32d2d3 |
15 | 7ac50a40b |
hex | 49b897959 |
19789347161 has 8 divisors (see below), whose sum is σ = 19831041000. Its totient is φ = 19747678720.
The previous prime is 19789347143. The next prime is 19789347167. The reversal of 19789347161 is 16174398791.
It can be written as a sum of positive squares in 4 ways, for example, as 8898337561 + 10891009600 = 94331^2 + 104360^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-19789347161 is a prime.
It is a super-2 number, since 2×197893471612 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 19789347097 and 19789347106.
It is not an unprimeable number, because it can be changed into a prime (19789347167) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2641541 + ... + 2649021.
It is an arithmetic number, because the mean of its divisors is an integer number (2478880125).
Almost surely, 219789347161 is an apocalyptic number.
It is an amenable number.
19789347161 is a deficient number, since it is larger than the sum of its proper divisors (41693839).
19789347161 is an equidigital number, since it uses as much as digits as its factorization.
19789347161 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12699.
The product of its digits is 2286144, while the sum is 56.
The spelling of 19789347161 in words is "nineteen billion, seven hundred eighty-nine million, three hundred forty-seven thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •