Base | Representation |
---|---|
bin | 110010000101110001… |
… | …1101100011110010100 |
3 | 101021122121100002121120 |
4 | 1210023203230132110 |
5 | 3230244412321410 |
6 | 121225513243540 |
7 | 10525431445602 |
oct | 1441343543624 |
9 | 337577302546 |
10 | 107568088980 |
11 | 4168a4223a0 |
12 | 18a204035b0 |
13 | a1b371a4c1 |
14 | 52c6218872 |
15 | 2be886b570 |
hex | 190b8ec794 |
107568088980 has 96 divisors (see below), whose sum is σ = 329513788800. Its totient is φ = 26002337280.
The previous prime is 107568088951. The next prime is 107568089003. The reversal of 107568088980 is 89880865701.
It is a Harshad number since it is a multiple of its sum of digits (60).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 3159 + ... + 463838.
It is an arithmetic number, because the mean of its divisors is an integer number (3432435300).
Almost surely, 2107568088980 is an apocalyptic number.
107568088980 is a gapful number since it is divisible by the number (10) 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 107568088980, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (164756894400).
107568088980 is an abundant number, since it is smaller than the sum of its proper divisors (221945699820).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
107568088980 is a wasteful number, since it uses less digits than its factorization.
107568088980 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 467369 (or 467367 counting only the distinct ones).
The product of its (nonzero) digits is 7741440, while the sum is 60.
The spelling of 107568088980 in words is "one hundred seven billion, five hundred sixty-eight million, eighty-eight thousand, nine hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •