Base | Representation |
---|---|
bin | 110001011001010110… |
… | …1110100010111000101 |
3 | 101010210201122220122110 |
4 | 1202302231310113011 |
5 | 3214221324224001 |
6 | 120421550251233 |
7 | 10443462320640 |
oct | 1426255642705 |
9 | 333721586573 |
10 | 106077570501 |
11 | 40a95028841 |
12 | 186851b6b19 |
13 | a006997ac6 |
14 | 51c42a2a57 |
15 | 2b5ca963d6 |
hex | 18b2b745c5 |
106077570501 has 8 divisors (see below), whose sum is σ = 161642012224. Its totient is φ = 60615754560.
The previous prime is 106077570493. The next prime is 106077570539. The reversal of 106077570501 is 105075770601.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 106077570501 - 23 = 106077570493 is a prime.
It is a super-2 number, since 2×1060775705012 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 106077570501.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106077570101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2525656420 + ... + 2525656461.
It is an arithmetic number, because the mean of its divisors is an integer number (20205251528).
Almost surely, 2106077570501 is an apocalyptic number.
It is an amenable number.
106077570501 is a deficient number, since it is larger than the sum of its proper divisors (55564441723).
106077570501 is an equidigital number, since it uses as much as digits as its factorization.
106077570501 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5051312891.
The product of its (nonzero) digits is 51450, while the sum is 39.
The spelling of 106077570501 in words is "one hundred six billion, seventy-seven million, five hundred seventy thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •