Base | Representation |
---|---|
bin | 1100101111000… |
… | …10000000000000 |
3 | 21110000121210000 |
4 | 12113202000000 |
5 | 204322104442 |
6 | 14333440000 |
7 | 2435025120 |
oct | 627420000 |
9 | 243017700 |
10 | 106831872 |
11 | 55338404 |
12 | 2b940000 |
13 | 19196334 |
14 | 1028cc80 |
15 | 95a3d4c |
hex | 65e2000 |
106831872 has 280 divisors, whose sum is σ = 380609856. Its totient is φ = 29196288.
The previous prime is 106831871. The next prime is 106831877. The reversal of 106831872 is 278138601.
It is a super-2 number, since 2×1068318722 = 22826097750048768, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is not an unprimeable number, because it can be changed into a prime (106831871) by changing a digit.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 4644853 + ... + 4644875.
Almost surely, 2106831872 is an apocalyptic number.
106831872 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 106831872, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (190304928).
106831872 is an abundant number, since it is smaller than the sum of its proper divisors (273777984).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106831872 is an frugal number, since it uses more digits than its factorization.
106831872 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 68 (or 35 counting only the distinct ones).
The product of its (nonzero) digits is 16128, while the sum is 36.
The square root of 106831872 is about 10335.9504642776. The cubic root of 106831872 is about 474.4971550309.
The spelling of 106831872 in words is "one hundred six million, eight hundred thirty-one thousand, eight hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •