Base | Representation |
---|---|
bin | 1101000011001… |
… | …10000111001000 |
3 | 21121222122211002 |
4 | 12201212013020 |
5 | 211011021102 |
6 | 14510154132 |
7 | 2466323651 |
oct | 641460710 |
9 | 247878732 |
10 | 109470152 |
11 | 5687a600 |
12 | 307b2948 |
13 | 198ab14c |
14 | 10778528 |
15 | 9925902 |
hex | 68661c8 |
109470152 has 24 divisors (see below), whose sum is σ = 225614550. Its totient is φ = 49758720.
The previous prime is 109470149. The next prime is 109470167. The reversal of 109470152 is 251074901.
It can be written as a sum of positive squares in only one way, i.e., 94984516 + 14485636 = 9746^2 + 3806^2 .
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 55577 + ... + 57512.
Almost surely, 2109470152 is an apocalyptic number.
It is an amenable number.
109470152 is an abundant number, since it is smaller than the sum of its proper divisors (116144398).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
109470152 is a wasteful number, since it uses less digits than its factorization.
109470152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 113117 (or 113102 counting only the distinct ones).
The product of its (nonzero) digits is 2520, while the sum is 29.
The square root of 109470152 is about 10462.7984784187. The cubic root of 109470152 is about 478.3714368132.
The spelling of 109470152 in words is "one hundred nine million, four hundred seventy thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •