Base | Representation |
---|---|
bin | 110001110110111000… |
… | …1001010110110101101 |
3 | 101020100202220102121212 |
4 | 1203231301022312231 |
5 | 3223233441223223 |
6 | 121104141204205 |
7 | 10510152401111 |
oct | 1435561126655 |
9 | 336322812555 |
10 | 107068304813 |
11 | 414532a3128 |
12 | 18900b60665 |
13 | a13400c722 |
14 | 5279abb741 |
15 | 2bb9a47278 |
hex | 18edc4adad |
107068304813 has 4 divisors (see below), whose sum is σ = 107098908000. Its totient is φ = 107037701628.
The previous prime is 107068304743. The next prime is 107068304851. The reversal of 107068304813 is 318403860701.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 318403860701 = 857 ⋅371533093.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-107068304813 is a prime.
It is a super-2 number, since 2×1070683048132 (a number of 23 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 (107068304713) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 15296345 + ... + 15303342.
It is an arithmetic number, because the mean of its divisors is an integer number (26774727000).
Almost surely, 2107068304813 is an apocalyptic number.
It is an amenable number.
107068304813 is a deficient number, since it is larger than the sum of its proper divisors (30603187).
107068304813 is an equidigital number, since it uses as much as digits as its factorization.
107068304813 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30603186.
The product of its (nonzero) digits is 96768, while the sum is 41.
The spelling of 107068304813 in words is "one hundred seven billion, sixty-eight million, three hundred four thousand, eight hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •