Base | Representation |
---|---|
bin | 11000110101011101100111… |
… | …011101101001100101111110 |
3 | 112022202000002212010020100122 |
4 | 120311131213131221211332 |
5 | 103304033444034132431 |
6 | 1024150114052054542 |
7 | 32002252046524106 |
oct | 3065354735514576 |
9 | 468660085106318 |
10 | 109227049130366 |
11 | 31891a277664a2 |
12 | 10300b25904452 |
13 | 48c40b3247c8b |
14 | 1cd889016a206 |
15 | c963a5e5ca7b |
hex | 63576776997e |
109227049130366 has 8 divisors (see below), whose sum is σ = 164335560324024. Its totient is φ = 54448529022360.
The previous prime is 109227049130359. The next prime is 109227049130389. The reversal of 109227049130366 is 663031940722901.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 82497770585 + ... + 82497771908.
It is an arithmetic number, because the mean of its divisors is an integer number (20541945040503).
Almost surely, 2109227049130366 is an apocalyptic number.
109227049130366 is a deficient number, since it is larger than the sum of its proper divisors (55108511193658).
109227049130366 is a wasteful number, since it uses less digits than its factorization.
109227049130366 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 164995542826.
The product of its (nonzero) digits is 2939328, while the sum is 53.
The spelling of 109227049130366 in words is "one hundred nine trillion, two hundred twenty-seven billion, forty-nine million, one hundred thirty thousand, three hundred sixty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •