Base | Representation |
---|---|
bin | 1100110001000… |
… | …00000011110100 |
3 | 21110111112110200 |
4 | 12120200003310 |
5 | 204403223233 |
6 | 14343120500 |
7 | 2440134165 |
oct | 630400364 |
9 | 243445420 |
10 | 107086068 |
11 | 554a1391 |
12 | 2ba43130 |
13 | 19254c4b |
14 | 1031776c |
15 | 9604313 |
hex | 66200f4 |
107086068 has 72 divisors (see below), whose sum is σ = 284077248. Its totient is φ = 33948288.
The previous prime is 107086061. The next prime is 107086093. The reversal of 107086068 is 860680701.
It is a super-2 number, since 2×1070860682 = 22934851919401248, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (107086061) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 234096 + ... + 234552.
Almost surely, 2107086068 is an apocalyptic number.
107086068 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 107086068, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (142038624).
107086068 is an abundant number, since it is smaller than the sum of its proper divisors (176991180).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
107086068 is a wasteful number, since it uses less digits than its factorization.
107086068 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 773 (or 768 counting only the distinct ones).
The product of its (nonzero) digits is 16128, while the sum is 36.
The square root of 107086068 is about 10348.2398503320. The cubic root of 107086068 is about 474.8731968080.
The spelling of 107086068 in words is "one hundred seven million, eighty-six thousand, sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •