Base | Representation |
---|---|
bin | 110010010101101100… |
… | …0101001010110000101 |
3 | 101100000211002210221101 |
4 | 1210223120221112011 |
5 | 3232343112012433 |
6 | 121354510220101 |
7 | 10544604243604 |
oct | 1445330512605 |
9 | 340024083841 |
10 | 108102063493 |
11 | 41933884346 |
12 | 18b4b1b4631 |
13 | a26a239658 |
14 | 53370d5a3b |
15 | 2c2a69607d |
hex | 192b629585 |
108102063493 has 4 divisors (see below), whose sum is σ = 108879776320. Its totient is φ = 107324350668.
The previous prime is 108102063481. The next prime is 108102063497. The reversal of 108102063493 is 394360201801.
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.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-108102063493 is a prime.
It is a super-2 number, since 2×1081020634932 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (108102063497) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 388856205 + ... + 388856482.
It is an arithmetic number, because the mean of its divisors is an integer number (27219944080).
Almost surely, 2108102063493 is an apocalyptic number.
It is an amenable number.
108102063493 is a deficient number, since it is larger than the sum of its proper divisors (777712827).
108102063493 is an equidigital number, since it uses as much as digits as its factorization.
108102063493 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 777712826.
The product of its (nonzero) digits is 31104, while the sum is 37.
The spelling of 108102063493 in words is "one hundred eight billion, one hundred two million, sixty-three thousand, four hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •