Base | Representation |
---|---|
bin | 1100101001011… |
… | …01100010000000 |
3 | 21101122001210020 |
4 | 12110231202000 |
5 | 204124431142 |
6 | 14305533440 |
7 | 2425526040 |
oct | 624554200 |
9 | 241561706 |
10 | 106092672 |
11 | 54982aa4 |
12 | 2b644280 |
13 | 18c97a3a |
14 | 10139720 |
15 | 94a9cec |
hex | 652d880 |
106092672 has 128 divisors (see below), whose sum is σ = 333417600. Its totient is φ = 29245440.
The previous prime is 106092667. The next prime is 106092689. The reversal of 106092672 is 276290601.
It is a tau number, because it is divible by the number of its divisors (128).
It is a super-2 number, since 2×1060926722 = 22511310104199168, which contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 77272 + ... + 78632.
It is an arithmetic number, because the mean of its divisors is an integer number (2604825).
Almost surely, 2106092672 is an apocalyptic number.
106092672 is a gapful number since it is divisible by the number (12) 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 106092672, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (166708800).
106092672 is an abundant number, since it is smaller than the sum of its proper divisors (227324928).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106092672 is a wasteful number, since it uses less digits than its factorization.
106092672 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1414 (or 1402 counting only the distinct ones).
The product of its (nonzero) digits is 9072, while the sum is 33.
The square root of 106092672 is about 10300.1297079212. The cubic root of 106092672 is about 473.4002277120.
The spelling of 106092672 in words is "one hundred six million, ninety-two thousand, six hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.202 sec. • engine limits •