Base | Representation |
---|---|
bin | 110010100101000010… |
… | …1100001101101111101 |
3 | 101101100201022200020010 |
4 | 1211022011201231331 |
5 | 3234421442121323 |
6 | 121521550213433 |
7 | 10563430333563 |
oct | 1451205415575 |
9 | 341321280203 |
10 | 108617145213 |
11 | 42078601915 |
12 | 190737b4279 |
13 | a31cb72335 |
14 | 5385695a33 |
15 | 2c5a9dcc93 |
hex | 194a161b7d |
108617145213 has 4 divisors (see below), whose sum is σ = 144822860288. Its totient is φ = 72411430140.
The previous prime is 108617145211. The next prime is 108617145233. The reversal of 108617145213 is 312541716801.
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, and also an emirpimes, since its reverse is a distinct semiprime: 312541716801 = 3 ⋅104180572267.
It is not a de Polignac number, because 108617145213 - 21 = 108617145211 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 (108617145211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 18102857533 + ... + 18102857538.
It is an arithmetic number, because the mean of its divisors is an integer number (36205715072).
Almost surely, 2108617145213 is an apocalyptic number.
It is an amenable number.
108617145213 is a deficient number, since it is larger than the sum of its proper divisors (36205715075).
108617145213 is an equidigital number, since it uses as much as digits as its factorization.
108617145213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36205715074.
The product of its (nonzero) digits is 40320, while the sum is 39.
The spelling of 108617145213 in words is "one hundred eight billion, six hundred seventeen million, one hundred forty-five thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •