Base | Representation |
---|---|
bin | 110010100001011001… |
… | …0110100000101101011 |
3 | 101101001012002212001201 |
4 | 1211002302310011223 |
5 | 3234144132033321 |
6 | 121501500025031 |
7 | 10560413401651 |
oct | 1450262640553 |
9 | 341035085051 |
10 | 108494799211 |
11 | 42015538517 |
12 | 1903a832177 |
13 | a300706656 |
14 | 5373328dd1 |
15 | 2c4edc2291 |
hex | 1942cb416b |
108494799211 has 4 divisors (see below), whose sum is σ = 108603621472. Its totient is φ = 108385976952.
The previous prime is 108494799169. The next prime is 108494799239. The reversal of 108494799211 is 112997494801.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 112997494801 = 3361512.
It is a cyclic number.
It is not a de Polignac number, because 108494799211 - 211 = 108494797163 is a prime.
It is a super-2 number, since 2×1084947992112 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (108494799241) 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, 54409635 + ... + 54411628.
It is an arithmetic number, because the mean of its divisors is an integer number (27150905368).
Almost surely, 2108494799211 is an apocalyptic number.
108494799211 is a deficient number, since it is larger than the sum of its proper divisors (108822261).
108494799211 is an equidigital number, since it uses as much as digits as its factorization.
108494799211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 108822260.
The product of its (nonzero) digits is 1306368, while the sum is 55.
The spelling of 108494799211 in words is "one hundred eight billion, four hundred ninety-four million, seven hundred ninety-nine thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •