Base | Representation |
---|---|
bin | 110011011011010111101… |
… | …1100100011101110000101 |
3 | 221000201011112212120102002 |
4 | 1212312233130203232011 |
5 | 1411301100130413221 |
6 | 23011023043355045 |
7 | 1326441465444122 |
oct | 146665734435605 |
9 | 27021145776362 |
10 | 7068164701061 |
11 | 2285656786132 |
12 | 961a36082a85 |
13 | 3c36a9774079 |
14 | 1a615b1c7749 |
15 | c3cd4b3280b |
hex | 66daf723b85 |
7068164701061 has 8 divisors (see below), whose sum is σ = 7075271546784. Its totient is φ = 7061061344400.
The previous prime is 7068164700991. The next prime is 7068164701093. The reversal of 7068164701061 is 1601074618607.
7068164701061 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
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 7068164701061 - 218 = 7068164438917 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 7068164700997 and 7068164701015.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (7068164301061) 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, 3190886 + ... + 4931336.
It is an arithmetic number, because the mean of its divisors is an integer number (884408943348).
Almost surely, 27068164701061 is an apocalyptic number.
It is an amenable number.
7068164701061 is a deficient number, since it is larger than the sum of its proper divisors (7106845723).
7068164701061 is a wasteful number, since it uses less digits than its factorization.
7068164701061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1744531.
The product of its (nonzero) digits is 338688, while the sum is 47.
The spelling of 7068164701061 in words is "seven trillion, sixty-eight billion, one hundred sixty-four million, seven hundred one thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •