Base | Representation |
---|---|
bin | 11000111100011011000011… |
… | …000011110110001101000000 |
3 | 112101102201121212202120211011 |
4 | 120330123003003312031000 |
5 | 103334403002233140000 |
6 | 1025153533115530304 |
7 | 32051643164423152 |
oct | 3074330303661500 |
9 | 471381555676734 |
10 | 109705327240000 |
11 | 31a5684a240188 |
12 | 10379764159994 |
13 | 492a225048b8b |
14 | 1d13aa2524ad2 |
15 | ca3a49a9a2ba |
hex | 63c6c30f6340 |
109705327240000 has 140 divisors (see below), whose sum is σ = 278359923486304. Its totient is φ = 42861615552000.
The previous prime is 109705327239997. The next prime is 109705327240007. The reversal of 109705327240000 is 42723507901.
It is a Harshad number since it is a multiple of its sum of digits (40).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (109705327240007) by changing a digit.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 30171084 + ... + 33611083.
Almost surely, 2109705327240000 is an apocalyptic number.
109705327240000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
109705327240000 is an abundant number, since it is smaller than the sum of its proper divisors (168654596246304).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
109705327240000 is an frugal number, since it uses more digits than its factorization.
109705327240000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 63782242 (or 63782217 counting only the distinct ones).
The product of its (nonzero) digits is 105840, while the sum is 40.
The spelling of 109705327240000 in words is "one hundred nine trillion, seven hundred five billion, three hundred twenty-seven million, two hundred forty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •