Base | Representation |
---|---|
bin | 110001111000000011… |
… | …1001100000001101000 |
3 | 101020110111220102022000 |
4 | 1203300013030001220 |
5 | 3223324023144313 |
6 | 121112104131000 |
7 | 10511140562244 |
oct | 1436007140150 |
9 | 336414812260 |
10 | 107107631208 |
11 | 41473513686 |
12 | 18912166a60 |
13 | a13c1cb796 |
14 | 5280dd7424 |
15 | 2bbd214673 |
hex | 18f01cc068 |
107107631208 has 64 divisors (see below), whose sum is σ = 298478044800. Its totient is φ = 35587722240.
The previous prime is 107107631201. The next prime is 107107631221. The reversal of 107107631208 is 802136701701.
107107631208 is a `hidden beast` number, since 1 + 0 + 7 + 10 + 7 + 631 + 2 + 0 + 8 = 666.
It is a super-2 number, since 2×1071076312082 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is not an unprimeable number, because it can be changed into a prime (107107631201) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 730041 + ... + 864392.
It is an arithmetic number, because the mean of its divisors is an integer number (4663719450).
Almost surely, 2107107631208 is an apocalyptic number.
107107631208 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is an amenable number.
107107631208 is an abundant number, since it is smaller than the sum of its proper divisors (191370413592).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
107107631208 is a wasteful number, since it uses less digits than its factorization.
107107631208 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1594759 (or 1594749 counting only the distinct ones).
The product of its (nonzero) digits is 14112, while the sum is 36.
The spelling of 107107631208 in words is "one hundred seven billion, one hundred seven million, six hundred thirty-one thousand, two hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •