Base | Representation |
---|---|
bin | 110001011101110011… |
… | …0111111001100110100 |
3 | 101011012010102021111221 |
4 | 1202323212333030310 |
5 | 3220023023243321 |
6 | 120444440240124 |
7 | 10450253455000 |
oct | 1427346771464 |
9 | 334163367457 |
10 | 106226774836 |
11 | 41061277206 |
12 | 18707170044 |
13 | a02b8787b0 |
14 | 51da021700 |
15 | 2b6ac19e41 |
hex | 18bb9bf334 |
106226774836 has 96 divisors (see below), whose sum is σ = 240997836800. Its totient is φ = 40667961600.
The previous prime is 106226774831. The next prime is 106226774887. The reversal of 106226774836 is 638477622601.
It is a super-2 number, since 2×1062267748362 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (52).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106226774831) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 456856 + ... + 648976.
Almost surely, 2106226774836 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 106226774836, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (120498918400).
106226774836 is an abundant number, since it is smaller than the sum of its proper divisors (134771061964).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106226774836 is a wasteful number, since it uses less digits than its factorization.
106226774836 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 192190 (or 192174 counting only the distinct ones).
The product of its (nonzero) digits is 4064256, while the sum is 52.
The spelling of 106226774836 in words is "one hundred six billion, two hundred twenty-six million, seven hundred seventy-four thousand, eight hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •