Base | Representation |
---|---|
bin | 110000011110110110… |
… | …0111101011100101111 |
3 | 100221201220122002111211 |
4 | 1200331230331130233 |
5 | 3201211242130221 |
6 | 115455101055251 |
7 | 10344023615521 |
oct | 1407554753457 |
9 | 327656562454 |
10 | 104114411311 |
11 | 40177964229 |
12 | 18217857527 |
13 | 9a8304c351 |
14 | 5079677a11 |
15 | 2a9555e6e1 |
hex | 183db3d72f |
104114411311 has 4 divisors (see below), whose sum is σ = 104561254512. Its totient is φ = 103667568112.
The previous prime is 104114411179. The next prime is 104114411381. The reversal of 104114411311 is 113114411401.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 104114411311 - 229 = 103577540399 is a prime.
It is a super-3 number, since 3×1041144113113 (a number of 34 digits) contains 333 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 (104114411381) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 223421251 + ... + 223421716.
It is an arithmetic number, because the mean of its divisors is an integer number (26140313628).
Almost surely, 2104114411311 is an apocalyptic number.
104114411311 is a deficient number, since it is larger than the sum of its proper divisors (446843201).
104114411311 is an equidigital number, since it uses as much as digits as its factorization.
104114411311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 446843200.
The product of its (nonzero) digits is 192, while the sum is 22.
Adding to 104114411311 its reverse (113114411401), we get a palindrome (217228822712).
The spelling of 104114411311 in words is "one hundred four billion, one hundred fourteen million, four hundred eleven thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •