Base | Representation |
---|---|
bin | 110001010110000110… |
… | …1100011110000000000 |
3 | 101010112010100001020011 |
4 | 1202230031203300000 |
5 | 3214010410404220 |
6 | 120403051354304 |
7 | 10440665653000 |
oct | 1425415436000 |
9 | 333463301204 |
10 | 105968450560 |
11 | 40a39478375 |
12 | 18654752994 |
13 | 9cba1b01ab |
14 | 51b39ba000 |
15 | 2b531de65a |
hex | 18ac363c00 |
105968450560 has 352 divisors, whose sum is σ = 300427545600. Its totient is φ = 35844931584.
The previous prime is 105968450449. The next prime is 105968450591. The reversal of 105968450560 is 65054869501.
It is a super-2 number, since 2×1059684505602 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (49).
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, 145760917 + ... + 145761643.
Almost surely, 2105968450560 is an apocalyptic number.
105968450560 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 105968450560, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (150213772800).
105968450560 is an abundant number, since it is smaller than the sum of its proper divisors (194459095040).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105968450560 is an frugal number, since it uses more digits than its factorization.
105968450560 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 856 (or 824 counting only the distinct ones).
The product of its (nonzero) digits is 1296000, while the sum is 49.
The spelling of 105968450560 in words is "one hundred five billion, nine hundred sixty-eight million, four hundred fifty thousand, five hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •