Base | Representation |
---|---|
bin | 101100110101000100011… |
… | …1110100111000010101111 |
3 | 210211000100021121020210001 |
4 | 1121222020332213002233 |
5 | 1301421300442413222 |
6 | 21034241543125131 |
7 | 1204065202144042 |
oct | 131521076470257 |
9 | 23730307536701 |
10 | 6161281216687 |
11 | 1a65a91693683 |
12 | 8361207437a7 |
13 | 359010b88cac |
14 | 1742c9934c59 |
15 | aa408154e27 |
hex | 59a88fa70af |
6161281216687 has 8 divisors (see below), whose sum is σ = 6518480799600. Its totient is φ = 5807373796224.
The previous prime is 6161281216589. The next prime is 6161281216691. The reversal of 6161281216687 is 7866121821616.
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 6161281216687 - 223 = 6161272828079 is a prime.
It is a super-2 number, since 2×61612812166872 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (6161288216687) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 823036762 + ... + 823044247.
It is an arithmetic number, because the mean of its divisors is an integer number (814810099950).
Almost surely, 26161281216687 is an apocalyptic number.
6161281216687 is a deficient number, since it is larger than the sum of its proper divisors (357199582913).
6161281216687 is a wasteful number, since it uses less digits than its factorization.
6161281216687 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1646081225.
The product of its digits is 2322432, while the sum is 55.
The spelling of 6161281216687 in words is "six trillion, one hundred sixty-one billion, two hundred eighty-one million, two hundred sixteen thousand, six hundred eighty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •