Base | Representation |
---|---|
bin | 1100101110010… |
… | …10000110110000 |
3 | 21102211122112010 |
4 | 12113022012300 |
5 | 204310442000 |
6 | 14331402520 |
7 | 2434136562 |
oct | 627120660 |
9 | 242748463 |
10 | 106734000 |
11 | 5528091a |
12 | 2b8b3440 |
13 | 19160919 |
14 | 10265332 |
15 | 9584d50 |
hex | 65ca1b0 |
106734000 has 80 divisors (see below), whose sum is σ = 344129760. Its totient is φ = 28460800.
The previous prime is 106733989. The next prime is 106734049. The reversal of 106734000 is 437601.
It is a tau number, because it is divible by the number of its divisors (80).
It is a super-2 number, since 2×1067340002 = 22784293512000000, 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, 2895 + ... + 14894.
It is an arithmetic number, because the mean of its divisors is an integer number (4301622).
Almost surely, 2106734000 is an apocalyptic number.
106734000 is a gapful number since it is divisible by the number (10) 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 106734000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (172064880).
106734000 is an abundant number, since it is smaller than the sum of its proper divisors (237395760).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106734000 is a wasteful number, since it uses less digits than its factorization.
106734000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 17815 (or 17799 counting only the distinct ones).
The product of its (nonzero) digits is 504, while the sum is 21.
The square root of 106734000 is about 10331.2148366008. The cubic root of 106734000 is about 474.3522102261.
The spelling of 106734000 in words is "one hundred six million, seven hundred thirty-four thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •