Base | Representation |
---|---|
bin | 1010010100010011101100… |
… | …0110100110001111111011 |
3 | 1111011110211212202011120111 |
4 | 2211010323012212033323 |
5 | 2441330003023322021 |
6 | 40043210050005151 |
7 | 2250401620564213 |
oct | 245047306461773 |
9 | 44143755664514 |
10 | 11344000214011 |
11 | 3683a66424243 |
12 | 13326628767b7 |
13 | 643971ca014a |
14 | 2b30a4253243 |
15 | 14a13bb188e1 |
hex | a513b1a63fb |
11344000214011 has 8 divisors (see below), whose sum is σ = 11646267258384. Its totient is φ = 11045000921760.
The previous prime is 11344000213993. The next prime is 11344000214021. The reversal of 11344000214011 is 11041200044311.
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 11344000214011 - 243 = 2547907191803 is a prime.
It is a super-3 number, since 3×113440002140113 (a number of 40 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11344000214021) 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, 816930996 + ... + 816944881.
It is an arithmetic number, because the mean of its divisors is an integer number (1455783407298).
Almost surely, 211344000214011 is an apocalyptic number.
11344000214011 is a deficient number, since it is larger than the sum of its proper divisors (302267044373).
11344000214011 is a wasteful number, since it uses less digits than its factorization.
11344000214011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1633876061.
The product of its (nonzero) digits is 384, while the sum is 22.
Adding to 11344000214011 its reverse (11041200044311), we get a palindrome (22385200258322).
The spelling of 11344000214011 in words is "eleven trillion, three hundred forty-four billion, two hundred fourteen thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •