Base | Representation |
---|---|
bin | 1010100110111001100110… |
… | …1010000001110011011101 |
3 | 1112022000022101101211100010 |
4 | 2221232121222001303131 |
5 | 3012043133004441000 |
6 | 40450033134553433 |
7 | 2312440163265336 |
oct | 251563152016335 |
9 | 45260271354303 |
10 | 11663414140125 |
11 | 3797476243580 |
12 | 1384545968879 |
13 | 667b16c456a7 |
14 | 2c47258bb28d |
15 | 1535d3876d50 |
hex | a9b99a81cdd |
11663414140125 has 32 divisors (see below), whose sum is σ = 21172277602944. Its totient is φ = 5654988672000.
The previous prime is 11663414140117. The next prime is 11663414140153. The reversal of 11663414140125 is 52104141436611.
It is not a de Polignac number, because 11663414140125 - 23 = 11663414140117 is a prime.
It is a congruent number.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 1413743044 + ... + 1413751293.
It is an arithmetic number, because the mean of its divisors is an integer number (661633675092).
Almost surely, 211663414140125 is an apocalyptic number.
11663414140125 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
11663414140125 is a deficient number, since it is larger than the sum of its proper divisors (9508863462819).
11663414140125 is a wasteful number, since it uses less digits than its factorization.
11663414140125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2827494366 (or 2827494356 counting only the distinct ones).
The product of its (nonzero) digits is 69120, while the sum is 39.
Adding to 11663414140125 its reverse (52104141436611), we get a palindrome (63767555576736).
The spelling of 11663414140125 in words is "eleven trillion, six hundred sixty-three billion, four hundred fourteen million, one hundred forty thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •