Base | Representation |
---|---|
bin | 110001111011001001… |
… | …1011101100011110100 |
3 | 101020201202101010000200 |
4 | 1203312103131203310 |
5 | 3224032121341202 |
6 | 121130254440500 |
7 | 10513541546661 |
oct | 1436623354364 |
9 | 336652333020 |
10 | 107211512052 |
11 | 41517115917 |
12 | 18940b03130 |
13 | a1578a0838 |
14 | 5290b18a68 |
15 | 2bc73d3e1c |
hex | 18f64dd8f4 |
107211512052 has 36 divisors (see below), whose sum is σ = 271019688576. Its totient is φ = 35735481360.
The previous prime is 107211512033. The next prime is 107211512071. The reversal of 107211512052 is 250215112701.
It is an interprime number because it is at equal distance from previous prime (107211512033) and next prime (107211512071).
It is a tau number, because it is divible by the number of its divisors (36).
It is a super-2 number, since 2×1072115120522 (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, 876093 + ... + 990939.
Almost surely, 2107211512052 is an apocalyptic number.
107211512052 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
107211512052 is an abundant number, since it is smaller than the sum of its proper divisors (163808176524).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
107211512052 is a wasteful number, since it uses less digits than its factorization.
107211512052 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 140788 (or 140783 counting only the distinct ones).
The product of its (nonzero) digits is 1400, while the sum is 27.
Adding to 107211512052 its reverse (250215112701), we get a palindrome (357426624753).
The spelling of 107211512052 in words is "one hundred seven billion, two hundred eleven million, five hundred twelve thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •