Base | Representation |
---|---|
bin | 110011000010110110… |
… | …1101011000101010000 |
3 | 101110221102201020102000 |
4 | 1212011231223011100 |
5 | 3243444041300242 |
6 | 122205123554000 |
7 | 10630265406126 |
oct | 1460555530520 |
9 | 343842636360 |
10 | 109617525072 |
11 | 42541265030 |
12 | 192b282b900 |
13 | a44c1b3393 |
14 | 543c4a1916 |
15 | 2cb8746a4c |
hex | 1985b6b150 |
109617525072 has 80 divisors (see below), whose sum is σ = 343246810560. Its totient is φ = 33217430400.
The previous prime is 109617525047. The next prime is 109617525077. The reversal of 109617525072 is 270525716901.
109617525072 is a `hidden beast` number, since 1 + 0 + 9 + 617 + 5 + 25 + 0 + 7 + 2 = 666.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (109617525077) 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 15 ways as a sum of consecutive naturals, for example, 11529079 + ... + 11538582.
It is an arithmetic number, because the mean of its divisors is an integer number (4290585132).
Almost surely, 2109617525072 is an apocalyptic number.
109617525072 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
109617525072 is an abundant number, since it is smaller than the sum of its proper divisors (233629285488).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
109617525072 is a wasteful number, since it uses less digits than its factorization.
109617525072 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23067689 (or 23067677 counting only the distinct ones).
The product of its (nonzero) digits is 264600, while the sum is 45.
The spelling of 109617525072 in words is "one hundred nine billion, six hundred seventeen million, five hundred twenty-five thousand, seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •