Base | Representation |
---|---|
bin | 1100101001011… |
… | …01101000000000 |
3 | 21101122002022110 |
4 | 12110231220000 |
5 | 204124434211 |
6 | 14305535320 |
7 | 2425530126 |
oct | 624555000 |
9 | 241562273 |
10 | 106093056 |
11 | 54983313 |
12 | 2b644540 |
13 | 18c97c74 |
14 | 10139916 |
15 | 94a9ea6 |
hex | 652da00 |
106093056 has 120 divisors (see below), whose sum is σ = 301498560. Its totient is φ = 33144832.
The previous prime is 106093003. The next prime is 106093061. The reversal of 106093056 is 650390601.
It is a happy number.
It is a super-2 number, since 2×1060930562 = 22511473062838272, which contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 443785 + ... + 444023.
It is an arithmetic number, because the mean of its divisors is an integer number (2512488).
Almost surely, 2106093056 is an apocalyptic number.
106093056 is a gapful number since it is divisible by the number (16) 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 106093056, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (150749280).
106093056 is an abundant number, since it is smaller than the sum of its proper divisors (195405504).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106093056 is an equidigital number, since it uses as much as digits as its factorization.
106093056 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 294 (or 261 counting only the distinct ones).
The product of its (nonzero) digits is 4860, while the sum is 30.
The square root of 106093056 is about 10300.1483484462. The cubic root of 106093056 is about 473.4007988651.
The spelling of 106093056 in words is "one hundred six million, ninety-three thousand, fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •