Base | Representation |
---|---|
bin | 11000110010110101111110… |
… | …101011000101100100011001 |
3 | 112022002210111101211001002101 |
4 | 120302311332223011210121 |
5 | 103243111324233333421 |
6 | 1023531305000003401 |
7 | 31653250360400524 |
oct | 3062657653054431 |
9 | 468083441731071 |
10 | 109047049902361 |
11 | 3182265990132a |
12 | 10292070460561 |
13 | 48b0128813c3c |
14 | 1ccdc964d1bbb |
15 | c9186d858191 |
hex | 632d7eac5919 |
109047049902361 has 4 divisors (see below), whose sum is σ = 109083170160400. Its totient is φ = 109010929644324.
The previous prime is 109047049902341. The next prime is 109047049902419. The reversal of 109047049902361 is 163209940740901.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 109047049902361 - 29 = 109047049901849 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (109047049902311) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 18060124491 + ... + 18060130528.
It is an arithmetic number, because the mean of its divisors is an integer number (27270792540100).
Almost surely, 2109047049902361 is an apocalyptic number.
It is an amenable number.
109047049902361 is a deficient number, since it is larger than the sum of its proper divisors (36120258039).
109047049902361 is an equidigital number, since it uses as much as digits as its factorization.
109047049902361 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36120258038.
The product of its (nonzero) digits is 2939328, while the sum is 55.
The spelling of 109047049902361 in words is "one hundred nine trillion, forty-seven billion, forty-nine million, nine hundred two thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.249 sec. • engine limits •