Base | Representation |
---|---|
bin | 1010000111011110000010… |
… | …1110101000110010010101 |
3 | 1110101101112201000111020200 |
4 | 2201313200232220302111 |
5 | 2424221301301321123 |
6 | 35354012121051113 |
7 | 2225433141333366 |
oct | 241674056506225 |
9 | 43341481014220 |
10 | 11123440651413 |
11 | 35a94742953a2 |
12 | 12b7969926a99 |
13 | 628c2239841c |
14 | 2a653d82bb6d |
15 | 14452d747143 |
hex | a1de0ba8c95 |
11123440651413 has 6 divisors (see below), whose sum is σ = 16067192052054. Its totient is φ = 7415627100936.
The previous prime is 11123440651357. The next prime is 11123440651441. The reversal of 11123440651413 is 31415604432111.
11123440651413 is a `hidden beast` number, since 1 + 1 + 1 + 234 + 4 + 0 + 6 + 5 + 1 + 413 = 666.
It can be written as a sum of positive squares in only one way, i.e., 11115509324049 + 7931327364 = 3333993^2 + 89058^2 .
It is not a de Polignac number, because 11123440651413 - 214 = 11123440635029 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11123440651613) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 617968925070 + ... + 617968925087.
It is an arithmetic number, because the mean of its divisors is an integer number (2677865342009).
Almost surely, 211123440651413 is an apocalyptic number.
It is an amenable number.
11123440651413 is a deficient number, since it is larger than the sum of its proper divisors (4943751400641).
11123440651413 is a wasteful number, since it uses less digits than its factorization.
11123440651413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1235937850163 (or 1235937850160 counting only the distinct ones).
The product of its (nonzero) digits is 34560, while the sum is 36.
The spelling of 11123440651413 in words is "eleven trillion, one hundred twenty-three billion, four hundred forty million, six hundred fifty-one thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •