Base | Representation |
---|---|
bin | 1100110101011011101101… |
… | …1100111110010101011111 |
3 | 1211222002211101101011020112 |
4 | 3031112323130332111133 |
5 | 3322203101300031421 |
6 | 50003003123040235 |
7 | 2654365206035231 |
oct | 315267334762537 |
9 | 54862741334215 |
10 | 14112112502111 |
11 | 4550a05672908 |
12 | 16bb031b1007b |
13 | 7b49c6cc83b0 |
14 | 36b05c034251 |
15 | 19714d6cc45b |
hex | cd5bb73e55f |
14112112502111 has 16 divisors (see below), whose sum is σ = 16429902300000. Its totient is φ = 12007417304448.
The previous prime is 14112112502083. The next prime is 14112112502153. The reversal of 14112112502111 is 11120521121141.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-14112112502111 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14112112502171) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 772072736 + ... + 772091013.
It is an arithmetic number, because the mean of its divisors is an integer number (1026868893750).
Almost surely, 214112112502111 is an apocalyptic number.
14112112502111 is a deficient number, since it is larger than the sum of its proper divisors (2317789797889).
14112112502111 is a wasteful number, since it uses less digits than its factorization.
14112112502111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1544163818.
The product of its (nonzero) digits is 160, while the sum is 23.
Adding to 14112112502111 its reverse (11120521121141), we get a palindrome (25232633623252).
The spelling of 14112112502111 in words is "fourteen trillion, one hundred twelve billion, one hundred twelve million, five hundred two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •