Base | Representation |
---|---|
bin | 110001111110100010… |
… | …1111100010100000000 |
3 | 101021000200200122121002 |
4 | 1203331011330110000 |
5 | 3224300301033022 |
6 | 121145443551132 |
7 | 10516423630430 |
oct | 1437505742400 |
9 | 337020618532 |
10 | 107325408512 |
11 | 41575438a23 |
12 | 1897308b4a8 |
13 | a17536b5aa |
14 | 52a1cc62c0 |
15 | 2bd23d1092 |
hex | 18fd17c500 |
107325408512 has 144 divisors (see below), whose sum is σ = 256303079424. Its totient is φ = 43884288000.
The previous prime is 107325408511. The next prime is 107325408517. The reversal of 107325408512 is 215804523701.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (107325408511) by changing a digit.
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, 3930587 + ... + 3957797.
It is an arithmetic number, because the mean of its divisors is an integer number (1779882496).
Almost surely, 2107325408512 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 107325408512, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (128151539712).
107325408512 is an abundant number, since it is smaller than the sum of its proper divisors (148977670912).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
107325408512 is an equidigital number, since it uses as much as digits as its factorization.
107325408512 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27336 (or 27322 counting only the distinct ones).
The product of its (nonzero) digits is 67200, while the sum is 38.
The spelling of 107325408512 in words is "one hundred seven billion, three hundred twenty-five million, four hundred eight thousand, five hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •