Base | Representation |
---|---|
bin | 110010111010111000… |
… | …1100110101001000000 |
3 | 101110020210112122121110 |
4 | 1211311301212221000 |
5 | 3242422112320000 |
6 | 122122412323320 |
7 | 10620540453402 |
oct | 1456561465100 |
9 | 343223478543 |
10 | 109350120000 |
11 | 42414323700 |
12 | 19239173540 |
13 | a408988724 |
14 | 5414b74b72 |
15 | 2ca0025850 |
hex | 1975c66a40 |
109350120000 has 840 divisors, whose sum is σ = 421717732128. Its totient is φ = 24893440000.
The previous prime is 109350119999. The next prime is 109350120007. The reversal of 109350120000 is 21053901.
It is not an unprimeable number, because it can be changed into a prime (109350120007) 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 119 ways as a sum of consecutive naturals, for example, 246839779 + ... + 246840221.
Almost surely, 2109350120000 is an apocalyptic number.
109350120000 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 109350120000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (210858866064).
109350120000 is an abundant number, since it is smaller than the sum of its proper divisors (312367612128).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
109350120000 is a wasteful number, since it uses less digits than its factorization.
109350120000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 517 (or 481 counting only the distinct ones).
The product of its (nonzero) digits is 270, while the sum is 21.
Adding to 109350120000 its reverse (21053901), we get a palindrome (109371173901).
The spelling of 109350120000 in words is "one hundred nine billion, three hundred fifty million, one hundred twenty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •