Base | Representation |
---|---|
bin | 10010010011001101… |
… | …110100001100000001 |
3 | 1212201102110022000021 |
4 | 102103031310030001 |
5 | 310220313212234 |
6 | 13005454053441 |
7 | 1263640022203 |
oct | 222315641401 |
9 | 55642408007 |
10 | 19649741569 |
11 | 8373848747 |
12 | 39847aa281 |
13 | 1b11c60c23 |
14 | d4598c773 |
15 | 7a01309b4 |
hex | 493374301 |
19649741569 has 4 divisors (see below), whose sum is σ = 19650268096. Its totient is φ = 19649215044.
The previous prime is 19649741563. The next prime is 19649741591. The reversal of 19649741569 is 96514794691.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 96514794691 = 7 ⋅13787827813.
It is a cyclic number.
It is not a de Polignac number, because 19649741569 - 211 = 19649739521 is a prime.
It is a super-4 number, since 4×196497415694 (a number of 42 digits) contains 4444 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (19649741563) 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, 202629 + ... + 283474.
It is an arithmetic number, because the mean of its divisors is an integer number (4912567024).
Almost surely, 219649741569 is an apocalyptic number.
It is an amenable number.
19649741569 is a deficient number, since it is larger than the sum of its proper divisors (526527).
19649741569 is an equidigital number, since it uses as much as digits as its factorization.
19649741569 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 526526.
The product of its digits is 14696640, while the sum is 61.
The spelling of 19649741569 in words is "nineteen billion, six hundred forty-nine million, seven hundred forty-one thousand, five hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •