Base | Representation |
---|---|
bin | 1001110011000011010001110… |
… | …1010010001110001000110001 |
3 | 10100102010210021001011200201012 |
4 | 2130300310131102032020301 |
5 | 1210331422314311144121 |
6 | 10442201002214320305 |
7 | 265136061415343003 |
oct | 23460643522161061 |
9 | 3312123231150635 |
10 | 689450116506161 |
11 | 18a75317492743a |
12 | 653b0075059095 |
13 | 23791b36aac41a |
14 | c2377c6a88373 |
15 | 54a92a68d6c5b |
hex | 2730d1d48e231 |
689450116506161 has 8 divisors (see below), whose sum is σ = 719457906046464. Its totient is φ = 659444968425760.
The previous prime is 689450116506113. The next prime is 689450116506167. The reversal of 689450116506161 is 161605611054986.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-689450116506161 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 689450116506161.
It is not an unprimeable number, because it can be changed into a prime (689450116506167) 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, 659831585 + ... + 660875646.
It is an arithmetic number, because the mean of its divisors is an integer number (89932238255808).
Almost surely, 2689450116506161 is an apocalyptic number.
It is an amenable number.
689450116506161 is a deficient number, since it is larger than the sum of its proper divisors (30007789540303).
689450116506161 is a wasteful number, since it uses less digits than its factorization.
689450116506161 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1320729951.
The product of its (nonzero) digits is 9331200, while the sum is 59.
The spelling of 689450116506161 in words is "six hundred eighty-nine trillion, four hundred fifty billion, one hundred sixteen million, five hundred six thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •