Base | Representation |
---|---|
bin | 1000101100000001010110… |
… | …11011100010101110001001 |
3 | 2111122101200101210120120112 |
4 | 10112000223123202232021 |
5 | 10001003003223014001 |
6 | 104344333045204105 |
7 | 4011162226401023 |
oct | 426005333425611 |
9 | 74571611716515 |
10 | 19104743173001 |
11 | 60a6304509332 |
12 | 2186763a00635 |
13 | a877533c3595 |
14 | 4a0962ba1013 |
15 | 231e58e7dcbb |
hex | 11602b6e2b89 |
19104743173001 has 12 divisors (see below), whose sum is σ = 20164855720500. Its totient is φ = 18097724118528.
The previous prime is 19104743172979. The next prime is 19104743173051. The reversal of 19104743173001 is 10037134740191.
It can be written as a sum of positive squares in 2 ways, for example, as 9142519795600 + 9962223377401 = 3023660^2 + 3156299^2 .
It is not a de Polignac number, because 19104743173001 - 214 = 19104743156617 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 19104743173001.
It is not an unprimeable number, because it can be changed into a prime (19104743173051) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 2153585 + ... + 6545793.
It is an arithmetic number, because the mean of its divisors is an integer number (1680404643375).
Almost surely, 219104743173001 is an apocalyptic number.
It is an amenable number.
19104743173001 is a deficient number, since it is larger than the sum of its proper divisors (1060112547499).
19104743173001 is a wasteful number, since it uses less digits than its factorization.
19104743173001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4404296 (or 4404277 counting only the distinct ones).
The product of its (nonzero) digits is 63504, while the sum is 41.
The spelling of 19104743173001 in words is "nineteen trillion, one hundred four billion, seven hundred forty-three million, one hundred seventy-three thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •