Base | Representation |
---|---|
bin | 1100101111011110… |
… | …01011001111111011 |
3 | 122122201222020200222 |
4 | 12113233023033323 |
5 | 103002204200010 |
6 | 3050443450255 |
7 | 331342636400 |
oct | 62757131773 |
9 | 18581866628 |
10 | 6840693755 |
11 | 29a0436515 |
12 | 13aab2698b |
13 | 8502c91ac |
14 | 48c72c2a7 |
15 | 2a084c355 |
hex | 197bcb3fb |
6840693755 has 24 divisors (see below), whose sum is σ = 9807145488. Its totient is φ = 4563978048.
The previous prime is 6840693707. The next prime is 6840693757. The reversal of 6840693755 is 5573960486.
It is not a de Polignac number, because 6840693755 - 28 = 6840693499 is a prime.
It is a hoax number, since the sum of its digits (53) coincides with the sum of the digits of its distinct prime factors.
It is a junction number, because it is equal to n+sod(n) for n = 6840693697 and 6840693706.
It is not an unprimeable number, because it can be changed into a prime (6840693757) 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 23 ways as a sum of consecutive naturals, for example, 368249 + ... + 386378.
It is an arithmetic number, because the mean of its divisors is an integer number (408631062).
Almost surely, 26840693755 is an apocalyptic number.
6840693755 is a deficient number, since it is larger than the sum of its proper divisors (2966451733).
6840693755 is a wasteful number, since it uses less digits than its factorization.
6840693755 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 754683 (or 754676 counting only the distinct ones).
The product of its (nonzero) digits is 5443200, while the sum is 53.
The square root of 6840693755 is about 82708.4865959957. The cubic root of 6840693755 is about 1898.3081666419.
The spelling of 6840693755 in words is "six billion, eight hundred forty million, six hundred ninety-three thousand, seven hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •