Base | Representation |
---|---|
bin | 1101000100110… |
… | …11111110100001 |
3 | 21122101212110200 |
4 | 12202123332201 |
5 | 211040101120 |
6 | 14515015413 |
7 | 2501233131 |
oct | 642337641 |
9 | 248355420 |
10 | 109690785 |
11 | 56a10346 |
12 | 3089a569 |
13 | 199576b9 |
14 | 107d4ac1 |
15 | 996ae90 |
hex | 689bfa1 |
109690785 has 24 divisors (see below), whose sum is σ = 194771304. Its totient is φ = 57073920.
The previous prime is 109690769. The next prime is 109690837. The reversal of 109690785 is 587096901.
It can be written as a sum of positive squares in 4 ways, for example, as 4915089 + 104775696 = 2217^2 + 10236^2 .
It is not a de Polignac number, because 109690785 - 24 = 109690769 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is an alternating number because its digits alternate between odd and even.
It is a self number, because there is not a number n which added to its sum of digits gives 109690785.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 27882 + ... + 31571.
It is an arithmetic number, because the mean of its divisors is an integer number (8115471).
Almost surely, 2109690785 is an apocalyptic number.
109690785 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
109690785 is a deficient number, since it is larger than the sum of its proper divisors (85080519).
109690785 is a wasteful number, since it uses less digits than its factorization.
109690785 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 59505 (or 59502 counting only the distinct ones).
The product of its (nonzero) digits is 136080, while the sum is 45.
The square root of 109690785 is about 10473.3368608099. The cubic root of 109690785 is about 478.6926010623.
The spelling of 109690785 in words is "one hundred nine million, six hundred ninety thousand, seven hundred eighty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •