Base | Representation |
---|---|
bin | 10111001100111011000111… |
… | …000101110101111101110101 |
3 | 111101022020021012011222221010 |
4 | 113030323013011311331311 |
5 | 101333333404320403432 |
6 | 1001005553035342433 |
7 | 30331242650006130 |
oct | 2714730705657565 |
9 | 441266235158833 |
10 | 102043173216117 |
11 | 2a5722a3025261 |
12 | b5407982b1a19 |
13 | 44c2825cb1233 |
14 | 1b2acb7485217 |
15 | bbe59cb413cc |
hex | 5ccec7175f75 |
102043173216117 has 8 divisors (see below), whose sum is σ = 155494359186496. Its totient is φ = 58310384694912.
The previous prime is 102043173216113. The next prime is 102043173216119. The reversal of 102043173216117 is 711612371340201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 102043173216117 - 22 = 102043173216113 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102043173216113) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 2429599362268 + ... + 2429599362309.
It is an arithmetic number, because the mean of its divisors is an integer number (19436794898312).
Almost surely, 2102043173216117 is an apocalyptic number.
It is an amenable number.
102043173216117 is a deficient number, since it is larger than the sum of its proper divisors (53451185970379).
102043173216117 is an equidigital number, since it uses as much as digits as its factorization.
102043173216117 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4859198724587.
The product of its (nonzero) digits is 42336, while the sum is 39.
The spelling of 102043173216117 in words is "one hundred two trillion, forty-three billion, one hundred seventy-three million, two hundred sixteen thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •