Base | Representation |
---|---|
bin | 110000011110110101… |
… | …1111011011111010101 |
3 | 100221201220010100220112 |
4 | 1200331223323133111 |
5 | 3201211210004031 |
6 | 115455051212405 |
7 | 10344021412043 |
oct | 1407553733725 |
9 | 327656110815 |
10 | 104114141141 |
11 | 4017779a24a |
12 | 18217747105 |
13 | 9a82c8639a |
14 | 5079607393 |
15 | 2a9550962b |
hex | 183dafb7d5 |
104114141141 has 4 divisors (see below), whose sum is σ = 109593832800. Its totient is φ = 98634449484.
The previous prime is 104114141129. The next prime is 104114141167. The reversal of 104114141141 is 141141411401.
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: 141141411401 = 467 ⋅302230003.
It is a cyclic number.
It is not a de Polignac number, because 104114141141 - 218 = 104113878997 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 (104114141041) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2739845801 + ... + 2739845838.
It is an arithmetic number, because the mean of its divisors is an integer number (27398458200).
Almost surely, 2104114141141 is an apocalyptic number.
It is an amenable number.
104114141141 is a deficient number, since it is larger than the sum of its proper divisors (5479691659).
104114141141 is an equidigital number, since it uses as much as digits as its factorization.
104114141141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5479691658.
The product of its (nonzero) digits is 256, while the sum is 23.
Adding to 104114141141 its reverse (141141411401), we get a palindrome (245255552542).
The spelling of 104114141141 in words is "one hundred four billion, one hundred fourteen million, one hundred forty-one thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •