Base | Representation |
---|---|
bin | 110000101101111011100… |
… | …1000110100001100011101 |
3 | 212201002210012212010120101 |
4 | 1201123313020310030131 |
5 | 1334200301031033321 |
6 | 22123544202421101 |
7 | 1260514551152230 |
oct | 141336710641435 |
9 | 25632705763511 |
10 | 6695705330461 |
11 | 21516a6114284 |
12 | 90180a201791 |
13 | 39752cb25854 |
14 | 192106997417 |
15 | b9285eb0791 |
hex | 616f723431d |
6695705330461 has 32 divisors (see below), whose sum is σ = 7960775049216. Its totient is φ = 5510677536000.
The previous prime is 6695705330443. The next prime is 6695705330491. The reversal of 6695705330461 is 1640335075966.
6695705330461 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 6695705330461 - 225 = 6695671776029 is a prime.
It is a Smith number, since the sum of its digits (55) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (6695705330401) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 194224456 + ... + 194258926.
It is an arithmetic number, because the mean of its divisors is an integer number (248774220288).
Almost surely, 26695705330461 is an apocalyptic number.
It is an amenable number.
6695705330461 is a deficient number, since it is larger than the sum of its proper divisors (1265069718755).
6695705330461 is a wasteful number, since it uses less digits than its factorization.
6695705330461 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 41473.
The product of its (nonzero) digits is 12247200, while the sum is 55.
The spelling of 6695705330461 in words is "six trillion, six hundred ninety-five billion, seven hundred five million, three hundred thirty thousand, four hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •