Base | Representation |
---|---|
bin | 1010110001011101100001… |
… | …1101010001100111101001 |
3 | 1112221100122102000000211110 |
4 | 2230113120131101213221 |
5 | 3023031231213404243 |
6 | 41105241340020533 |
7 | 2331522404041062 |
oct | 254273035214751 |
9 | 45840572000743 |
10 | 11844856388073 |
11 | 38574146aaa05 |
12 | 13b3742531749 |
13 | 67bc7160b497 |
14 | 2cd419065569 |
15 | 1581a29bce33 |
hex | ac5d87519e9 |
11844856388073 has 8 divisors (see below), whose sum is σ = 15803194779936. Its totient is φ = 7891544460800.
The previous prime is 11844856388051. The next prime is 11844856388107. The reversal of 11844856388073 is 37088365844811.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 11844856388073 - 217 = 11844856257001 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11844856387995 and 11844856388013.
It is not an unprimeable number, because it can be changed into a prime (11844856388473) 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 7 ways as a sum of consecutive naturals, for example, 1256610648 + ... + 1256620073.
It is an arithmetic number, because the mean of its divisors is an integer number (1975399347492).
Almost surely, 211844856388073 is an apocalyptic number.
It is an amenable number.
11844856388073 is a deficient number, since it is larger than the sum of its proper divisors (3958338391863).
11844856388073 is a wasteful number, since it uses less digits than its factorization.
11844856388073 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2513232295.
The product of its (nonzero) digits is 123863040, while the sum is 66.
The spelling of 11844856388073 in words is "eleven trillion, eight hundred forty-four billion, eight hundred fifty-six million, three hundred eighty-eight thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •