Base | Representation |
---|---|
bin | 1100111111110… |
… | …00101100010000 |
3 | 21121010220000200 |
4 | 12133320230100 |
5 | 210402200333 |
6 | 14452415200 |
7 | 2462446206 |
oct | 637705420 |
9 | 247126020 |
10 | 109021968 |
11 | 565a3900 |
12 | 30617500 |
13 | 19782153 |
14 | 1069d076 |
15 | 9887c13 |
hex | 67f8b10 |
109021968 has 90 divisors (see below), whose sum is σ = 335422542. Its totient is φ = 33031680.
The previous prime is 109021961. The next prime is 109021973. The reversal of 109021968 is 869120901.
It can be written as a sum of positive squares in only one way, i.e., 108743184 + 278784 = 10428^2 + 528^2 .
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 (109021961) by changing a digit.
It is a polite number, since it can be written in 17 ways as a sum of consecutive naturals, for example, 14296 + ... + 20552.
Almost surely, 2109021968 is an apocalyptic number.
109021968 is a gapful number since it is divisible by the number (18) 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 109021968, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (167711271).
109021968 is an abundant number, since it is smaller than the sum of its proper divisors (226400574).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
109021968 is a wasteful number, since it uses less digits than its factorization.
109021968 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6293 (or 6273 counting only the distinct ones).
The product of its (nonzero) digits is 7776, while the sum is 36.
The square root of 109021968 is about 10441.3585322984. The cubic root of 109021968 is about 477.7177070722.
The spelling of 109021968 in words is "one hundred nine million, twenty-one thousand, nine hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •