Base | Representation |
---|---|
bin | 110001101000100010… |
… | …1100111110100001010 |
3 | 101012010020111001211020 |
4 | 1203101011213310022 |
5 | 3221242301031200 |
6 | 120544312013310 |
7 | 10462220426355 |
oct | 1432105476412 |
9 | 335106431736 |
10 | 106587127050 |
11 | 41226722158 |
12 | 187a7991236 |
13 | a088417961 |
14 | 5231c2529c |
15 | 2b8c69aea0 |
hex | 18d1167d0a |
106587127050 has 48 divisors (see below), whose sum is σ = 264361294080. Its totient is φ = 28420522240.
The previous prime is 106587127039. The next prime is 106587127069. The reversal of 106587127050 is 50721785601.
It is a super-2 number, since 2×1065871270502 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 106587126993 and 106587127011.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1916434 + ... + 1971266.
It is an arithmetic number, because the mean of its divisors is an integer number (5507526960).
Almost surely, 2106587127050 is an apocalyptic number.
106587127050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
106587127050 is an abundant number, since it is smaller than the sum of its proper divisors (157774167030).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106587127050 is a wasteful number, since it uses less digits than its factorization.
106587127050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 67807 (or 67802 counting only the distinct ones).
The product of its (nonzero) digits is 117600, while the sum is 42.
The spelling of 106587127050 in words is "one hundred six billion, five hundred eighty-seven million, one hundred twenty-seven thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •