Base | Representation |
---|---|
bin | 1100110111011… |
… | …01010100011100 |
3 | 21112002020202100 |
4 | 12123231110130 |
5 | 210112124222 |
6 | 14413125100 |
7 | 2450235300 |
oct | 633552434 |
9 | 245066670 |
10 | 107926812 |
11 | 55a16014 |
12 | 30189790 |
13 | 1948a826 |
14 | 10495d00 |
15 | 971d4ac |
hex | 66ed51c |
107926812 has 216 divisors, whose sum is σ = 347321520. Its totient is φ = 28062720.
The previous prime is 107926769. The next prime is 107926813. The reversal of 107926812 is 218629701.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (107926813) by changing a digit.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 1769262 + ... + 1769322.
It is an arithmetic number, because the mean of its divisors is an integer number (1607970).
Almost surely, 2107926812 is an apocalyptic number.
107926812 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 107926812, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (173660760).
107926812 is an abundant number, since it is smaller than the sum of its proper divisors (239394708).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
107926812 is a wasteful number, since it uses less digits than its factorization.
107926812 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 161 (or 149 counting only the distinct ones).
The product of its (nonzero) digits is 12096, while the sum is 36.
The square root of 107926812 is about 10388.7829893592. The cubic root of 107926812 is about 476.1127184038.
The spelling of 107926812 in words is "one hundred seven million, nine hundred twenty-six thousand, eight hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •