Base | Representation |
---|---|
bin | 110001011101110011… |
… | …0101110010101101111 |
3 | 101011012010021202210010 |
4 | 1202323212232111233 |
5 | 3220023014041100 |
6 | 120444434544303 |
7 | 10450253046441 |
oct | 1427346562557 |
9 | 334163252703 |
10 | 106226705775 |
11 | 4106122a333 |
12 | 18707138093 |
13 | a02b853228 |
14 | 51da004491 |
15 | 2b6ac04750 |
hex | 18bb9ae56f |
106226705775 has 24 divisors (see below), whose sum is σ = 183264163200. Its totient is φ = 54191014240.
The previous prime is 106226705747. The next prime is 106226705779. The reversal of 106226705775 is 577507622601.
It is not a de Polignac number, because 106226705775 - 216 = 106226640239 is a prime.
It is a super-2 number, since 2×1062267057752 (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 (106226705779) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 30788625 + ... + 30792074.
It is an arithmetic number, because the mean of its divisors is an integer number (7636006800).
Almost surely, 2106226705775 is an apocalyptic number.
106226705775 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
106226705775 is a deficient number, since it is larger than the sum of its proper divisors (77037457425).
106226705775 is a wasteful number, since it uses less digits than its factorization.
106226705775 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 61580735 (or 61580730 counting only the distinct ones).
The product of its (nonzero) digits is 1234800, while the sum is 48.
The spelling of 106226705775 in words is "one hundred six billion, two hundred twenty-six million, seven hundred five thousand, seven hundred seventy-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •