Base | Representation |
---|---|
bin | 1101000101110… |
… | …10110010001011 |
3 | 21122122021120020 |
4 | 12202322302023 |
5 | 211103120341 |
6 | 14521431523 |
7 | 2502300045 |
oct | 642726213 |
9 | 248567506 |
10 | 109816971 |
11 | 56a97130 |
12 | 3093b5a3 |
13 | 1999cc74 |
14 | 10828a95 |
15 | 9993566 |
hex | 68bac8b |
109816971 has 8 divisors (see below), whose sum is σ = 159733824. Its totient is φ = 66555720.
The previous prime is 109816963. The next prime is 109816981. The reversal of 109816971 is 179618901.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 109816971 - 23 = 109816963 is a prime.
It is a super-2 number, since 2×1098169712 = 24119534239229682, which contains 22 as substring.
It is a Smith number, since the sum of its digits (42) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is not an unprimeable number, because it can be changed into a prime (109816921) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1663861 + ... + 1663926.
It is an arithmetic number, because the mean of its divisors is an integer number (19966728).
Almost surely, 2109816971 is an apocalyptic number.
109816971 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
109816971 is a deficient number, since it is larger than the sum of its proper divisors (49916853).
109816971 is a wasteful number, since it uses less digits than its factorization.
109816971 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3327801.
The product of its (nonzero) digits is 27216, while the sum is 42.
The square root of 109816971 is about 10479.3592838494. The cubic root of 109816971 is about 478.8760900604.
The spelling of 109816971 in words is "one hundred nine million, eight hundred sixteen thousand, nine hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •