Base | Representation |
---|---|
bin | 110000011100011001… |
… | …1111000100010101101 |
3 | 100221112012012110000212 |
4 | 1200320303320202231 |
5 | 3201024234341031 |
6 | 115443010032205 |
7 | 10342006205132 |
oct | 1407063704255 |
9 | 327465173025 |
10 | 104032340141 |
11 | 401355a8a14 |
12 | 181b4278665 |
13 | 9a6c045322 |
14 | 506c7d2589 |
15 | 2a8d24c12b |
hex | 1838cf88ad |
104032340141 has 4 divisors (see below), whose sum is σ = 104034098784. Its totient is φ = 104030581500.
The previous prime is 104032340107. The next prime is 104032340149. The reversal of 104032340141 is 141043230401.
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: 141043230401 = 29 ⋅4863559669.
It is a cyclic number.
It is not a de Polignac number, because 104032340141 - 226 = 103965231277 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (104032340149) 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, 787385 + ... + 909966.
It is an arithmetic number, because the mean of its divisors is an integer number (26008524696).
Almost surely, 2104032340141 is an apocalyptic number.
It is an amenable number.
104032340141 is a deficient number, since it is larger than the sum of its proper divisors (1758643).
104032340141 is an equidigital number, since it uses as much as digits as its factorization.
104032340141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1758642.
The product of its (nonzero) digits is 1152, while the sum is 23.
Adding to 104032340141 its reverse (141043230401), we get a palindrome (245075570542).
The spelling of 104032340141 in words is "one hundred four billion, thirty-two million, three hundred forty thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •