Base | Representation |
---|---|
bin | 10111101101111100100010… |
… | …000100111101000100011011 |
3 | 111200100011122110120210122120 |
4 | 113231330202010331010123 |
5 | 102133023340231121021 |
6 | 1005504250254352323 |
7 | 30654216365115126 |
oct | 2755744204750433 |
9 | 450304573523576 |
10 | 104312442442011 |
11 | 3026772737a971 |
12 | b848549abb6a3 |
13 | 462880c7865ab |
14 | 1ba8a6b9633bd |
15 | c0d6154532c6 |
hex | 5edf2213d11b |
104312442442011 has 8 divisors (see below), whose sum is σ = 139084273107024. Its totient is φ = 69541120035840.
The previous prime is 104312442441973. The next prime is 104312442442049. The reversal of 104312442442011 is 110244244213401.
It is an interprime number because it is at equal distance from previous prime (104312442441973) and next prime (104312442442049).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 104312442442011 - 213 = 104312442433819 is a prime.
It is not an unprimeable number, because it can be changed into a prime (104312442444011) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 126585570 + ... + 127406951.
It is an arithmetic number, because the mean of its divisors is an integer number (17385534138378).
Almost surely, 2104312442442011 is an apocalyptic number.
104312442442011 is a deficient number, since it is larger than the sum of its proper divisors (34771830665013).
104312442442011 is a wasteful number, since it uses less digits than its factorization.
104312442442011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 254129421.
The product of its (nonzero) digits is 24576, while the sum is 33.
Adding to 104312442442011 its reverse (110244244213401), we get a palindrome (214556686655412).
The spelling of 104312442442011 in words is "one hundred four trillion, three hundred twelve billion, four hundred forty-two million, four hundred forty-two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •