Base | Representation |
---|---|
bin | 11000101100011001100… |
… | …001011100100011000001 |
3 | 20000020002200111221110001 |
4 | 120230121201130203001 |
5 | 210300313202430001 |
6 | 3335321423240001 |
7 | 233412522250051 |
oct | 30543141344301 |
9 | 6006080457401 |
10 | 1696940280001 |
11 | 5a473960467a |
12 | 234a65a49001 |
13 | c4036871875 |
14 | 5c1bd23b561 |
15 | 2e21bdd0001 |
hex | 18b1985c8c1 |
1696940280001 has 8 divisors (see below), whose sum is σ = 1755518106600. Its totient is φ = 1638366629760.
The previous prime is 1696940279987. The next prime is 1696940280017. The reversal of 1696940280001 is 1000820496961.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 278040017025 + 1418900262976 = 527295^2 + 1191176^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1696940280001 - 213 = 1696940271809 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1696940280031) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 206010 + ... + 1853731.
It is an arithmetic number, because the mean of its divisors is an integer number (219439763325).
Almost surely, 21696940280001 is an apocalyptic number.
It is an amenable number.
1696940280001 is a deficient number, since it is larger than the sum of its proper divisors (58577826599).
1696940280001 is a wasteful number, since it uses less digits than its factorization.
1696940280001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2088179.
The product of its (nonzero) digits is 186624, while the sum is 46.
The spelling of 1696940280001 in words is "one trillion, six hundred ninety-six billion, nine hundred forty million, two hundred eighty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •