Base | Representation |
---|---|
bin | 110001100110010011111… |
… | …0000010100000010011001 |
3 | 220010200022010100102122002 |
4 | 1203030213300110002121 |
5 | 1343141231144401121 |
6 | 22255330250410345 |
7 | 1302332110413140 |
oct | 143144760240231 |
9 | 26120263312562 |
10 | 6816780075161 |
11 | 2198a86703a61 |
12 | 921179a309b5 |
13 | 3a5a8688a414 |
14 | 197d10946757 |
15 | bc4c04ade0b |
hex | 63327c14099 |
6816780075161 has 8 divisors (see below), whose sum is σ = 7791683545920. Its totient is φ = 5842146040848.
The previous prime is 6816780075121. The next prime is 6816780075163. The reversal of 6816780075161 is 1615700876186.
It is a happy number.
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-6816780075161 is a prime.
It is a super-2 number, since 2×68167800751612 (a number of 26 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 = 6816780075097 and 6816780075106.
It is not an unprimeable number, because it can be changed into a prime (6816780075163) 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, 67304891 + ... + 67406096.
It is an arithmetic number, because the mean of its divisors is an integer number (973960443240).
Almost surely, 26816780075161 is an apocalyptic number.
It is an amenable number.
6816780075161 is a deficient number, since it is larger than the sum of its proper divisors (974903470759).
6816780075161 is a wasteful number, since it uses less digits than its factorization.
6816780075161 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 134718223.
The product of its (nonzero) digits is 3386880, while the sum is 56.
The spelling of 6816780075161 in words is "six trillion, eight hundred sixteen billion, seven hundred eighty million, seventy-five thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •