Base | Representation |
---|---|
bin | 110001011010010100… |
… | …1101110000011000101 |
3 | 101010212222210001211102 |
4 | 1202310221232003011 |
5 | 3214303133104001 |
6 | 120425110345445 |
7 | 10444335355550 |
oct | 1426451560305 |
9 | 333788701742 |
10 | 106110050501 |
11 | 410013a2514 |
12 | 1869405b285 |
13 | a01062a840 |
14 | 51c8719697 |
15 | 2b6085ee6b |
hex | 18b4a6e0c5 |
106110050501 has 32 divisors (see below), whose sum is σ = 131175195648. Its totient is φ = 83584327680.
The previous prime is 106110050483. The next prime is 106110050507. The reversal of 106110050501 is 105050011601.
It is not a de Polignac number, because 106110050501 - 210 = 106110049477 is a prime.
It is a super-2 number, since 2×1061100505012 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106110050507) by changing a digit.
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 31 ways as a sum of consecutive naturals, for example, 22473821 + ... + 22478541.
It is an arithmetic number, because the mean of its divisors is an integer number (4099224864).
Almost surely, 2106110050501 is an apocalyptic number.
It is an amenable number.
106110050501 is a deficient number, since it is larger than the sum of its proper divisors (25065145147).
106110050501 is a wasteful number, since it uses less digits than its factorization.
106110050501 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5781.
The product of its (nonzero) digits is 150, while the sum is 20.
The spelling of 106110050501 in words is "one hundred six billion, one hundred ten million, fifty thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •