Base | Representation |
---|---|
bin | 11000100101010101011… |
… | …000001001001101010101 |
3 | 12222111112000121102020112 |
4 | 120211111120021031111 |
5 | 210134244230233421 |
6 | 3332025002412405 |
7 | 233023531442432 |
oct | 30452530111525 |
9 | 5874460542215 |
10 | 1689354539861 |
11 | 5a14a666184a |
12 | 2334a9501105 |
13 | c33c80c3831 |
14 | 5ba9d9aab89 |
15 | 2de25e6345b |
hex | 18955609355 |
1689354539861 has 8 divisors (see below), whose sum is σ = 1705811128320. Its totient is φ = 1672899010992.
The previous prime is 1689354539819. The next prime is 1689354539863.
1689354539861 is nontrivially palindromic in base 10.
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 1689354539861 - 226 = 1689287430997 is a prime.
It is a super-2 number, since 2×16893545398612 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1689354539791 and 1689354539800.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1689354539863) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3153035 + ... + 3649703.
It is an arithmetic number, because the mean of its divisors is an integer number (213226391040).
Almost surely, 21689354539861 is an apocalyptic number.
It is an amenable number.
1689354539861 is a deficient number, since it is larger than the sum of its proper divisors (16456588459).
1689354539861 is a wasteful number, since it uses less digits than its factorization.
1689354539861 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 529795.
The product of its digits is 167961600, while the sum is 68.
The spelling of 1689354539861 in words is "one trillion, six hundred eighty-nine billion, three hundred fifty-four million, five hundred thirty-nine thousand, eight hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •