Base | Representation |
---|---|
bin | 100000000111001… |
… | …1110010101110000 |
3 | 2210002120111122220 |
4 | 1000032132111300 |
5 | 4201322123422 |
6 | 254531201040 |
7 | 35462622462 |
oct | 10016362560 |
9 | 2702514586 |
10 | 1077536112 |
11 | 503271914 |
12 | 260a46180 |
13 | 142316c43 |
14 | a3172132 |
15 | 648e9e5c |
hex | 4039e570 |
1077536112 has 20 divisors (see below), whose sum is σ = 2783635080. Its totient is φ = 359178688.
The previous prime is 1077536101. The next prime is 1077536153. The reversal of 1077536112 is 2116357701.
It is a super-3 number, since 3×10775361123 (a number of 28 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
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 3 ways as a sum of consecutive naturals, for example, 11224287 + ... + 11224382.
It is an arithmetic number, because the mean of its divisors is an integer number (139181754).
Almost surely, 21077536112 is an apocalyptic number.
1077536112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1077536112 is an abundant number, since it is smaller than the sum of its proper divisors (1706098968).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1077536112 is a wasteful number, since it uses less digits than its factorization.
1077536112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22448680 (or 22448674 counting only the distinct ones).
The product of its (nonzero) digits is 8820, while the sum is 33.
The square root of 1077536112 is about 32825.8451833308. The cubic root of 1077536112 is about 1025.2047537021.
The spelling of 1077536112 in words is "one billion, seventy-seven million, five hundred thirty-six thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •