Base | Representation |
---|---|
bin | 1100110101100100010010… |
… | …0001101111010111011111 |
3 | 1211222022202122201102222122 |
4 | 3031121010201233113133 |
5 | 3322222304012330421 |
6 | 50004023234133155 |
7 | 2654506202304464 |
oct | 315310441572737 |
9 | 54868678642878 |
10 | 14114412230111 |
11 | 4551985818566 |
12 | 16bb5741211bb |
13 | 7b4ca25a67ab |
14 | 36b1d963166b |
15 | 1972355482ab |
hex | cd64486f5df |
14114412230111 has 8 divisors (see below), whose sum is σ = 14351406597024. Its totient is φ = 13877598849120.
The previous prime is 14114412230101. The next prime is 14114412230123. The reversal of 14114412230111 is 11103221441141.
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 14114412230111 - 222 = 14114408035807 is a prime.
It is a super-3 number, since 3×141144122301113 (a number of 40 digits) contains 333 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14114412230101) 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, 45089195 + ... + 45401148.
It is an arithmetic number, because the mean of its divisors is an integer number (1793925824628).
Almost surely, 214114412230111 is an apocalyptic number.
14114412230111 is a deficient number, since it is larger than the sum of its proper divisors (236994366913).
14114412230111 is an equidigital number, since it uses as much as digits as its factorization.
14114412230111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 90492961.
The product of its (nonzero) digits is 768, while the sum is 26.
Adding to 14114412230111 its reverse (11103221441141), we get a palindrome (25217633671252).
The spelling of 14114412230111 in words is "fourteen trillion, one hundred fourteen billion, four hundred twelve million, two hundred thirty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •