Base | Representation |
---|---|
bin | 110010001001011011… |
… | …1110010001101011100 |
3 | 101021222011020020211010 |
4 | 1210102313302031130 |
5 | 3231022320431433 |
6 | 121250015255220 |
7 | 10531451442615 |
oct | 1442267621534 |
9 | 337864206733 |
10 | 107690795868 |
11 | 41742712947 |
12 | 18a5551a510 |
13 | a202c81526 |
14 | 52d863ac0c |
15 | 2c04508e63 |
hex | 1912df235c |
107690795868 has 24 divisors (see below), whose sum is σ = 262203677568. Its totient is φ = 34336195696.
The previous prime is 107690795867. The next prime is 107690795869. The reversal of 107690795868 is 868597096701.
It is an interprime number because it is at equal distance from previous prime (107690795867) and next prime (107690795869).
It is a junction number, because it is equal to n+sod(n) for n = 107690795799 and 107690795808.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (107690795867) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 195091746 + ... + 195092297.
It is an arithmetic number, because the mean of its divisors is an integer number (10925153232).
Almost surely, 2107690795868 is an apocalyptic number.
It is an amenable number.
107690795868 is an abundant number, since it is smaller than the sum of its proper divisors (154512881700).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
107690795868 is a wasteful number, since it uses less digits than its factorization.
107690795868 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 390184073 (or 390184071 counting only the distinct ones).
The product of its (nonzero) digits is 45722880, while the sum is 66.
The spelling of 107690795868 in words is "one hundred seven billion, six hundred ninety million, seven hundred ninety-five thousand, eight hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.103 sec. • engine limits •