Base | Representation |
---|---|
bin | 110000010100101111… |
… | …0000000000000000000 |
3 | 100220212020212102122212 |
4 | 1200221132000000000 |
5 | 3200012341222110 |
6 | 115401253121252 |
7 | 10332432323606 |
oct | 1405136000000 |
9 | 326766772585 |
10 | 103774945280 |
11 | 40013284396 |
12 | 18142029228 |
13 | 9a2a913a86 |
14 | 504654d876 |
15 | 2a75856e05 |
hex | 1829780000 |
103774945280 has 160 divisors (see below), whose sum is σ = 257295139200. Its totient is φ = 40139489280.
The previous prime is 103774945189. The next prime is 103774945297. The reversal of 103774945280 is 82549477301.
It is a tau number, because it is divible by the number of its divisors (160).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 81264002 + ... + 81265278.
It is an arithmetic number, because the mean of its divisors is an integer number (1608094620).
Almost surely, 2103774945280 is an apocalyptic number.
103774945280 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 103774945280, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (128647569600).
103774945280 is an abundant number, since it is smaller than the sum of its proper divisors (153520193920).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103774945280 is an frugal number, since it uses more digits than its factorization.
103774945280 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1351 (or 1315 counting only the distinct ones).
The product of its (nonzero) digits is 1693440, while the sum is 50.
The spelling of 103774945280 in words is "one hundred three billion, seven hundred seventy-four million, nine hundred forty-five thousand, two hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •