Base | Representation |
---|---|
bin | 10010011011111101… |
… | …100111000111101001 |
3 | 1220002122120211012111 |
4 | 102123331213013221 |
5 | 311020400114211 |
6 | 13032215242321 |
7 | 1300401243304 |
oct | 223375470751 |
9 | 56078524174 |
10 | 19796488681 |
11 | 8439668a52 |
12 | 3a059793a1 |
13 | 1b36491338 |
14 | d5b26bb3b |
15 | 7ace6b421 |
hex | 49bf671e9 |
19796488681 has 4 divisors (see below), whose sum is σ = 19816032132. Its totient is φ = 19776945232.
The previous prime is 19796488669. The next prime is 19796488693. The reversal of 19796488681 is 18688469791.
It is a semiprime because it is the product of two primes.
It is an interprime number because it is at equal distance from previous prime (19796488669) and next prime (19796488693).
It can be written as a sum of positive squares in 2 ways, for example, as 7337464281 + 12459024400 = 85659^2 + 111620^2 .
It is a cyclic number.
It is not a de Polignac number, because 19796488681 - 27 = 19796488553 is a prime.
It is a super-2 number, since 2×197964886812 (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 (19796488381) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 9770206 + ... + 9772231.
It is an arithmetic number, because the mean of its divisors is an integer number (4954008033).
Almost surely, 219796488681 is an apocalyptic number.
It is an amenable number.
19796488681 is a deficient number, since it is larger than the sum of its proper divisors (19543451).
19796488681 is a wasteful number, since it uses less digits than its factorization.
19796488681 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19543450.
The product of its digits is 41803776, while the sum is 67.
The spelling of 19796488681 in words is "nineteen billion, seven hundred ninety-six million, four hundred eighty-eight thousand, six hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •