Base | Representation |
---|---|
bin | 11000110101010011011100… |
… | …111111100011100001001001 |
3 | 112022200221221022020100111010 |
4 | 120311103130333203201021 |
5 | 103303344121312111021 |
6 | 1024141111130554133 |
7 | 32001414444056355 |
oct | 3065233477434111 |
9 | 468627838210433 |
10 | 109216136050761 |
11 | 318883375a6243 |
12 | 102ba99ab98949 |
13 | 48c306433491c |
14 | 1cd8136a44465 |
15 | c95e67d3c976 |
hex | 6354dcfe3849 |
109216136050761 has 32 divisors (see below), whose sum is σ = 146373198491520. Its totient is φ = 72435625920000.
The previous prime is 109216136050751. The next prime is 109216136050771. The reversal of 109216136050761 is 167050631612901.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (109216136050751) and next prime (109216136050771).
It is not a de Polignac number, because 109216136050761 - 239 = 108666380236873 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 109216136050761.
It is not an unprimeable number, because it can be changed into a prime (109216136050751) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 4845210151 + ... + 4845232691.
It is an arithmetic number, because the mean of its divisors is an integer number (4574162452860).
Almost surely, 2109216136050761 is an apocalyptic number.
It is an amenable number.
109216136050761 is a deficient number, since it is larger than the sum of its proper divisors (37157062440759).
109216136050761 is a wasteful number, since it uses less digits than its factorization.
109216136050761 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30057.
The product of its (nonzero) digits is 408240, while the sum is 48.
The spelling of 109216136050761 in words is "one hundred nine trillion, two hundred sixteen billion, one hundred thirty-six million, fifty thousand, seven hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •