Base | Representation |
---|---|
bin | 10111101111110100011110… |
… | …100011000011000111011001 |
3 | 111200210111002001022110201220 |
4 | 113233310132203003013121 |
5 | 102142131120423203423 |
6 | 1010043350103002253 |
7 | 30666426045260025 |
oct | 2757643643030731 |
9 | 450714061273656 |
10 | 104441232241113 |
11 | 30307306906169 |
12 | b8694b1439389 |
13 | 46379c5a04801 |
14 | 1bb0da8405385 |
15 | c11b51e139e3 |
hex | 5efd1e8c31d9 |
104441232241113 has 4 divisors (see below), whose sum is σ = 139254976321488. Its totient is φ = 69627488160740.
The previous prime is 104441232241057. The next prime is 104441232241147. The reversal of 104441232241113 is 311142232144401.
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 not a de Polignac number, because 104441232241113 - 210 = 104441232240089 is a prime.
It is not an unprimeable number, because it can be changed into a prime (104441232243113) 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, 17406872040183 + ... + 17406872040188.
It is an arithmetic number, because the mean of its divisors is an integer number (34813744080372).
Almost surely, 2104441232241113 is an apocalyptic number.
It is an amenable number.
104441232241113 is a deficient number, since it is larger than the sum of its proper divisors (34813744080375).
104441232241113 is an equidigital number, since it uses as much as digits as its factorization.
104441232241113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34813744080374.
The product of its (nonzero) digits is 18432, while the sum is 33.
Adding to 104441232241113 its reverse (311142232144401), we get a palindrome (415583464385514).
The spelling of 104441232241113 in words is "one hundred four trillion, four hundred forty-one billion, two hundred thirty-two million, two hundred forty-one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •