Base | Representation |
---|---|
bin | 110000010010111001… |
… | …0011100011011110000 |
3 | 100220200221200020020121 |
4 | 1200211302130123300 |
5 | 3144401034231020 |
6 | 115351205420024 |
7 | 10331052422056 |
oct | 1404562343360 |
9 | 326627606217 |
10 | 103713195760 |
11 | 3aa91439029 |
12 | 1812540a614 |
13 | 9a1aba36b5 |
14 | 503c2781d6 |
15 | 2a7020abaa |
hex | 1825c9c6f0 |
103713195760 has 80 divisors (see below), whose sum is σ = 249176408832. Its totient is φ = 40146120960.
The previous prime is 103713195749. The next prime is 103713195779. The reversal of 103713195760 is 67591317301.
It is a tau number, because it is divible by the number of its divisors (80).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2361522 + ... + 2405038.
Almost surely, 2103713195760 is an apocalyptic number.
103713195760 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 103713195760, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (124588204416).
103713195760 is an abundant number, since it is smaller than the sum of its proper divisors (145463213072).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103713195760 is an frugal number, since it uses more digits than its factorization.
103713195760 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43623 (or 43555 counting only the distinct ones).
The product of its (nonzero) digits is 119070, while the sum is 43.
The spelling of 103713195760 in words is "one hundred three billion, seven hundred thirteen million, one hundred ninety-five thousand, seven hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •