Base | Representation |
---|---|
bin | 11000110101010001110111… |
… | …011101010111110101000101 |
3 | 112022200210112120212122020021 |
4 | 120311101313131113311011 |
5 | 103303332124220404143 |
6 | 1024140230115535141 |
7 | 32001324310645030 |
oct | 3065216735276505 |
9 | 468623476778207 |
10 | 109214432591173 |
11 | 31887642a8a8a8 |
12 | 102ba5a45ba4b1 |
13 | 48c2b52446780 |
14 | 1cd80146dc017 |
15 | c95db8503ced |
hex | 635477757d45 |
109214432591173 has 32 divisors (see below), whose sum is σ = 139082253811200. Its totient is φ = 83414077883136.
The previous prime is 109214432591161. The next prime is 109214432591233. The reversal of 109214432591173 is 371195234412901.
It is not a de Polignac number, because 109214432591173 - 217 = 109214432460101 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 109214432591173.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (109214432591273) 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, 8118448 + ... + 16862326.
It is an arithmetic number, because the mean of its divisors is an integer number (4346320431600).
Almost surely, 2109214432591173 is an apocalyptic number.
109214432591173 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
109214432591173 is a deficient number, since it is larger than the sum of its proper divisors (29867821220027).
109214432591173 is a wasteful number, since it uses less digits than its factorization.
109214432591173 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8748661.
The product of its (nonzero) digits is 1632960, while the sum is 52.
The spelling of 109214432591173 in words is "one hundred nine trillion, two hundred fourteen billion, four hundred thirty-two million, five hundred ninety-one thousand, one hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •