Base | Representation |
---|---|
bin | 1100110001100… |
… | …11100110010000 |
3 | 21110122121020200 |
4 | 12120303212100 |
5 | 204413303341 |
6 | 14344535200 |
7 | 2440616412 |
oct | 630634620 |
9 | 243577220 |
10 | 107166096 |
11 | 55546524 |
12 | 2ba81500 |
13 | 192824bb |
14 | 103389b2 |
15 | 961cdb6 |
hex | 6633990 |
107166096 has 60 divisors (see below), whose sum is σ = 317565612. Its totient is φ = 33619968.
The previous prime is 107166091. The next prime is 107166109. The reversal of 107166096 is 690661701.
It can be written as a sum of positive squares in 2 ways, for example, as 36000000 + 71166096 = 6000^2 + 8436^2 .
It is a super-2 number, since 2×1071660962 = 22969144263762432, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a self number, because there is not a number n which added to its sum of digits gives 107166096.
It is not an unprimeable number, because it can be changed into a prime (107166091) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 19441 + ... + 24336.
Almost surely, 2107166096 is an apocalyptic number.
107166096 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
107166096 is an abundant number, since it is smaller than the sum of its proper divisors (210399516).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
107166096 is a wasteful number, since it uses less digits than its factorization.
107166096 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 43808 (or 43799 counting only the distinct ones).
The product of its (nonzero) digits is 13608, while the sum is 36.
The square root of 107166096 is about 10352.1058727198. The cubic root of 107166096 is about 474.9914620811.
The spelling of 107166096 in words is "one hundred seven million, one hundred sixty-six thousand, ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •