Base | Representation |
---|---|
bin | 110010110110011010… |
… | …1010111010101110001 |
3 | 101102212100021101220010 |
4 | 1211230311113111301 |
5 | 3242120212022321 |
6 | 122055453205133 |
7 | 10614036425304 |
oct | 1455465272561 |
9 | 342770241803 |
10 | 109200110961 |
11 | 42347685697 |
12 | 191b6a907a9 |
13 | a3b3885696 |
14 | 53dcc86b3b |
15 | 2c91c93676 |
hex | 196cd57571 |
109200110961 has 8 divisors (see below), whose sum is σ = 145681541440. Its totient is φ = 72759377232.
The previous prime is 109200110939. The next prime is 109200110983. The reversal of 109200110961 is 169011002901.
It is an interprime number because it is at equal distance from previous prime (109200110939) and next prime (109200110983).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 109200110961 - 29 = 109200110449 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (109200111961) 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, 10167925 + ... + 10178658.
It is an arithmetic number, because the mean of its divisors is an integer number (18210192680).
Almost surely, 2109200110961 is an apocalyptic number.
It is an amenable number.
109200110961 is a deficient number, since it is larger than the sum of its proper divisors (36481430479).
109200110961 is a wasteful number, since it uses less digits than its factorization.
109200110961 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20348375.
The product of its (nonzero) digits is 972, while the sum is 30.
The spelling of 109200110961 in words is "one hundred nine billion, two hundred million, one hundred ten thousand, nine hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •