Base | Representation |
---|---|
bin | 1100101100110… |
… | …11001000000000 |
3 | 21102110212120000 |
4 | 12112123020000 |
5 | 204233312233 |
6 | 14323320000 |
7 | 2432405550 |
oct | 626331000 |
9 | 242425500 |
10 | 106541568 |
11 | 5515a291 |
12 | 2b820000 |
13 | 190c4163 |
14 | 10215160 |
15 | 9547d13 |
hex | 659b200 |
106541568 has 200 divisors, whose sum is σ = 364417152. Its totient is φ = 30357504.
The previous prime is 106541549. The next prime is 106541579. The reversal of 106541568 is 865145601.
106541568 is a `hidden beast` number, since 106 + 541 + 5 + 6 + 8 = 666.
It is a super-2 number, since 2×1065415682 = 22702211423797248, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 290121 + ... + 290487.
Almost surely, 2106541568 is an apocalyptic number.
106541568 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 106541568, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (182208576).
106541568 is an abundant number, since it is smaller than the sum of its proper divisors (257875584).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106541568 is an frugal number, since it uses more digits than its factorization.
106541568 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 404 (or 379 counting only the distinct ones).
The product of its (nonzero) digits is 28800, while the sum is 36.
The square root of 106541568 is about 10321.8974999755. The cubic root of 106541568 is about 474.0669669845.
The spelling of 106541568 in words is "one hundred six million, five hundred forty-one thousand, five hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •