Base | Representation |
---|---|
bin | 100001000001001… |
… | …1001100010100000 |
3 | 2212012202102120220 |
4 | 1002002121202200 |
5 | 4232112101102 |
6 | 301534403040 |
7 | 36312131325 |
oct | 10202314240 |
9 | 2765672526 |
10 | 1107925152 |
11 | 519438624 |
12 | 26b060480 |
13 | 1486c7019 |
14 | a7202b4c |
15 | 673ee1bc |
hex | 420998a0 |
1107925152 has 48 divisors (see below), whose sum is σ = 2915160192. Its totient is φ = 368437760.
The previous prime is 1107925141. The next prime is 1107925163. The reversal of 1107925152 is 2515297011.
It is an interprime number because it is at equal distance from previous prime (1107925141) and next prime (1107925163).
It is a tau number, because it is divible by the number of its divisors (48).
It is a super-3 number, since 3×11079251523 (a number of 28 digits) contains 333 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 27988 + ... + 54764.
It is an arithmetic number, because the mean of its divisors is an integer number (60732504).
Almost surely, 21107925152 is an apocalyptic number.
1107925152 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1107925152 is an abundant number, since it is smaller than the sum of its proper divisors (1807235040).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1107925152 is a wasteful number, since it uses less digits than its factorization.
1107925152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27221 (or 27213 counting only the distinct ones).
The product of its (nonzero) digits is 6300, while the sum is 33.
The square root of 1107925152 is about 33285.5096400821. The cubic root of 1107925152 is about 1034.7532693863.
The spelling of 1107925152 in words is "one billion, one hundred seven million, nine hundred twenty-five thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.208 sec. • engine limits •