Base | Representation |
---|---|
bin | 1010011010001001101101… |
… | …1001110001101110101001 |
3 | 1111112001222220211221110001 |
4 | 2212202123121301232221 |
5 | 3000001112411233223 |
6 | 40201252420023001 |
7 | 2260554621550633 |
oct | 246423331615651 |
9 | 44461886757401 |
10 | 11444400102313 |
11 | 37125a7559342 |
12 | 134a002531a61 |
13 | 6502825b2389 |
14 | 2b7caa449a53 |
15 | 14ca65ee39ad |
hex | a689b671ba9 |
11444400102313 has 8 divisors (see below), whose sum is σ = 11555907342336. Its totient is φ = 11333430247200.
The previous prime is 11444400102269. The next prime is 11444400102341. The reversal of 11444400102313 is 31320100444411.
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 11444400102313 - 225 = 11444366547881 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11444400102383) 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, 134303428 + ... + 134388613.
It is an arithmetic number, because the mean of its divisors is an integer number (1444488417792).
Almost surely, 211444400102313 is an apocalyptic number.
It is an amenable number.
11444400102313 is a deficient number, since it is larger than the sum of its proper divisors (111507240023).
11444400102313 is a wasteful number, since it uses less digits than its factorization.
11444400102313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 268692455.
The product of its (nonzero) digits is 4608, while the sum is 28.
Adding to 11444400102313 its reverse (31320100444411), we get a palindrome (42764500546724).
The spelling of 11444400102313 in words is "eleven trillion, four hundred forty-four billion, four hundred million, one hundred two thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •