Base | Representation |
---|---|
bin | 11001010001010111010011… |
… | …101011111000011000110011 |
3 | 112120112022011202002020110220 |
4 | 121101113103223320120303 |
5 | 104031442233033324243 |
6 | 1032215013004424123 |
7 | 32260630226034246 |
oct | 3121272353703063 |
9 | 476468152066426 |
10 | 111144420214323 |
11 | 324610a1755711 |
12 | 10570649548043 |
13 | 4a02b48b1bb02 |
14 | 1d635c0a7325d |
15 | ccb1c4c78783 |
hex | 6515d3af8633 |
111144420214323 has 8 divisors (see below), whose sum is σ = 153302648571600. Its totient is φ = 71541235999968.
The previous prime is 111144420214313. The next prime is 111144420214357. The reversal of 111144420214323 is 323412024441111.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 111144420214323 - 29 = 111144420213811 is a prime.
It is a super-2 number, since 2×1111444202143232 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (111144420214313) 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, 638761035628 + ... + 638761035801.
It is an arithmetic number, because the mean of its divisors is an integer number (19162831071450).
Almost surely, 2111144420214323 is an apocalyptic number.
111144420214323 is a deficient number, since it is larger than the sum of its proper divisors (42158228357277).
111144420214323 is a wasteful number, since it uses less digits than its factorization.
111144420214323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1277522071461.
The product of its (nonzero) digits is 18432, while the sum is 33.
Adding to 111144420214323 its reverse (323412024441111), we get a palindrome (434556444655434).
The spelling of 111144420214323 in words is "one hundred eleven trillion, one hundred forty-four billion, four hundred twenty million, two hundred fourteen thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •