Base | Representation |
---|---|
bin | 110010111110111011… |
… | …1110011001100010000 |
3 | 101110121021011010210122 |
4 | 1211331313303030100 |
5 | 3243211401241000 |
6 | 122144104045412 |
7 | 10624110215252 |
oct | 1457567631420 |
9 | 343537133718 |
10 | 109485962000 |
11 | 42483a75818 |
12 | 19276763868 |
13 | a42ab6b2cc |
14 | 5428c15cd2 |
15 | 2cabe0a085 |
hex | 197ddf3310 |
109485962000 has 160 divisors (see below), whose sum is σ = 274310880480. Its totient is φ = 42215577600.
The previous prime is 109485961993. The next prime is 109485962023. The reversal of 109485962000 is 269584901.
It can be written as a sum of positive squares in 16 ways, for example, as 67949891584 + 41536070416 = 260672^2 + 203804^2 .
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, 49472894 + ... + 49475106.
It is an arithmetic number, because the mean of its divisors is an integer number (1714443003).
Almost surely, 2109485962000 is an apocalyptic number.
109485962000 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 109485962000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (137155440240).
109485962000 is an abundant number, since it is smaller than the sum of its proper divisors (164824918480).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
109485962000 is a wasteful number, since it uses less digits than its factorization.
109485962000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3118 (or 3102 counting only the distinct ones).
The product of its (nonzero) digits is 155520, while the sum is 44.
The spelling of 109485962000 in words is "one hundred nine billion, four hundred eighty-five million, nine hundred sixty-two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •