Base | Representation |
---|---|
bin | 11000111001000010101001… |
… | …101001001000001111010000 |
3 | 112100121111212200110110010220 |
4 | 120321002221221020033100 |
5 | 103322101121434242400 |
6 | 1024455104520553040 |
7 | 32026106212345641 |
oct | 3071025151101720 |
9 | 470544780413126 |
10 | 109472972571600 |
11 | 31977255075810 |
12 | 10340719022780 |
13 | 491134588b501 |
14 | 1d0673d3b96c8 |
15 | c9c99ae2c7a0 |
hex | 6390a9a483d0 |
109472972571600 has 240 divisors, whose sum is σ = 383512307909184. Its totient is φ = 26472719360000.
The previous prime is 109472972571593. The next prime is 109472972571629. The reversal of 109472972571600 is 6175279274901.
It is a tau number, because it is divible by the number of its divisors (240).
It is a Harshad number since it is a multiple of its sum of digits (60).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 5047707 + ... + 15634106.
Almost surely, 2109472972571600 is an apocalyptic number.
109472972571600 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
109472972571600 is an abundant number, since it is smaller than the sum of its proper divisors (274039335337584).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
109472972571600 is a wasteful number, since it uses less digits than its factorization.
109472972571600 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20682246 (or 20682235 counting only the distinct ones).
The product of its (nonzero) digits is 13335840, while the sum is 60.
The spelling of 109472972571600 in words is "one hundred nine trillion, four hundred seventy-two billion, nine hundred seventy-two million, five hundred seventy-one thousand, six hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •