Base | Representation |
---|---|
bin | 110001110110010000… |
… | …0011001010000000000 |
3 | 101020022022001122101200 |
4 | 1203230200121100000 |
5 | 3223213031130422 |
6 | 121102103301200 |
7 | 10506504410226 |
oct | 1435440312000 |
9 | 336268048350 |
10 | 107047130112 |
11 | 4144235027a |
12 | 188b5a4a800 |
13 | a12c807710 |
14 | 5276d68b16 |
15 | 2bb7c632ac |
hex | 18ec819400 |
107047130112 has 132 divisors (see below), whose sum is σ = 332873273460. Its totient is φ = 32937541632.
The previous prime is 107047130107. The next prime is 107047130147. The reversal of 107047130112 is 211031740701.
107047130112 is a `hidden beast` number, since 10 + 70 + 471 + 3 + 0 + 112 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 49861103616 + 57186026496 = 223296^2 + 239136^2 .
It is a super-2 number, since 2×1070471301122 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 326937 + ... + 566552.
Almost surely, 2107047130112 is an apocalyptic number.
107047130112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
107047130112 is an abundant number, since it is smaller than the sum of its proper divisors (225826143348).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
107047130112 is a wasteful number, since it uses less digits than its factorization.
107047130112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 893528 (or 893507 counting only the distinct ones).
The product of its (nonzero) digits is 1176, while the sum is 27.
Adding to 107047130112 its reverse (211031740701), we get a palindrome (318078870813).
The spelling of 107047130112 in words is "one hundred seven billion, forty-seven million, one hundred thirty thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •