Base | Representation |
---|---|
bin | 1100101110110… |
… | …01010001010100 |
3 | 21102221210201201 |
4 | 12113121101110 |
5 | 204314433431 |
6 | 14333002244 |
7 | 2434515640 |
oct | 627312124 |
9 | 242853651 |
10 | 106796116 |
11 | 55313559 |
12 | 2b923384 |
13 | 19182c8b |
14 | 1027dc20 |
15 | 9598461 |
hex | 65d9454 |
106796116 has 48 divisors (see below), whose sum is σ = 224207872. Its totient is φ = 43545600.
The previous prime is 106796111. The next prime is 106796117. The reversal of 106796116 is 611697601.
It is a super-2 number, since 2×1067961162 = 22810820785370912, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106796111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 51940 + ... + 53956.
Almost surely, 2106796116 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 106796116, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (112103936).
106796116 is an abundant number, since it is smaller than the sum of its proper divisors (117411756).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106796116 is a wasteful number, since it uses less digits than its factorization.
106796116 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2120 (or 2118 counting only the distinct ones).
The product of its (nonzero) digits is 13608, while the sum is 37.
The square root of 106796116 is about 10334.2206285719. The cubic root of 106796116 is about 474.4442119870. Note that the first 3 decimals are identical.
The spelling of 106796116 in words is "one hundred six million, seven hundred ninety-six thousand, one hundred sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •