Base | Representation |
---|---|
bin | 10010100110101101… |
… | …111001011111011001 |
3 | 1220120020002122001221 |
4 | 102212231321133121 |
5 | 311403042402001 |
6 | 13102142412041 |
7 | 1305022003234 |
oct | 224655713731 |
9 | 56506078057 |
10 | 19976919001 |
11 | 85214a4a16 |
12 | 3a56291021 |
13 | 1b64986040 |
14 | d771d841b |
15 | 7bdc0c1a1 |
hex | 4a6b797d9 |
19976919001 has 4 divisors (see below), whose sum is σ = 21513605092. Its totient is φ = 18440232912.
The previous prime is 19976918989. The next prime is 19976919013. The reversal of 19976919001 is 10091967991.
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 (19976918989) and next prime (19976919013).
It can be written as a sum of positive squares in 2 ways, for example, as 850305600 + 19126613401 = 29160^2 + 138299^2 .
It is a cyclic number.
It is not a de Polignac number, because 19976919001 - 213 = 19976910809 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 19976919001.
It is not an unprimeable number, because it can be changed into a prime (19976919041) 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, 768343026 + ... + 768343051.
It is an arithmetic number, because the mean of its divisors is an integer number (5378401273).
Almost surely, 219976919001 is an apocalyptic number.
It is an amenable number.
19976919001 is a deficient number, since it is larger than the sum of its proper divisors (1536686091).
19976919001 is a wasteful number, since it uses less digits than its factorization.
19976919001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1536686090.
The product of its (nonzero) digits is 275562, while the sum is 52.
The spelling of 19976919001 in words is "nineteen billion, nine hundred seventy-six million, nine hundred nineteen thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •