Base | Representation |
---|---|
bin | 110011000011000110… |
… | …0010001000111000000 |
3 | 101110221222210200220000 |
4 | 1212012030101013000 |
5 | 3244003114421102 |
6 | 122210011520000 |
7 | 10630423521234 |
oct | 1460614210700 |
9 | 343858720800 |
10 | 109625545152 |
11 | 425458426a2 |
12 | 192b5459000 |
13 | a450a609a6 |
14 | 543d58c5c4 |
15 | 2cb92cd01c |
hex | 19863111c0 |
109625545152 has 70 divisors (see below), whose sum is σ = 324964473768. Its totient is φ = 36541846656.
The previous prime is 109625545087. The next prime is 109625545229. The reversal of 109625545152 is 251545526901.
109625545152 is a `hidden beast` number, since 1 + 0 + 9 + 625 + 5 + 4 + 5 + 15 + 2 = 666.
It is a junction number, because it is equal to n+sod(n) for n = 109625545098 and 109625545107.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 10568268 + ... + 10578635.
Almost surely, 2109625545152 is an apocalyptic number.
109625545152 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
109625545152 is an abundant number, since it is smaller than the sum of its proper divisors (215338928616).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
109625545152 is an equidigital number, since it uses as much as digits as its factorization.
109625545152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21146927 (or 21146908 counting only the distinct ones).
The product of its (nonzero) digits is 540000, while the sum is 45.
The spelling of 109625545152 in words is "one hundred nine billion, six hundred twenty-five million, five hundred forty-five thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •