Base | Representation |
---|---|
bin | 11001111110001010100100… |
… | …101000011000111011110101 |
3 | 112222102121211210020210012010 |
4 | 121332022210220120323311 |
5 | 104432412423303234031 |
6 | 1042533213351314433 |
7 | 33026230311125661 |
oct | 3176124450307365 |
9 | 488377753223163 |
10 | 114223122321141 |
11 | 3343883283a079 |
12 | 1098925867ba19 |
13 | 4b9726a905792 |
14 | 202c6001b18a1 |
15 | d31313a65246 |
hex | 67e2a4a18ef5 |
114223122321141 has 24 divisors (see below), whose sum is σ = 156314418967200. Its totient is φ = 74190495921696.
The previous prime is 114223122321109. The next prime is 114223122321149. The reversal of 114223122321141 is 141123221322411.
It is not a de Polignac number, because 114223122321141 - 25 = 114223122321109 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 114223122321099 and 114223122321108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (114223122321149) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 23732191 + ... + 28136508.
It is an arithmetic number, because the mean of its divisors is an integer number (6513100790300).
Almost surely, 2114223122321141 is an apocalyptic number.
It is an amenable number.
114223122321141 is a deficient number, since it is larger than the sum of its proper divisors (42091296646059).
114223122321141 is an equidigital number, since it uses as much as digits as its factorization.
114223122321141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 51869185 (or 51869142 counting only the distinct ones).
The product of its digits is 4608, while the sum is 30.
Adding to 114223122321141 its reverse (141123221322411), we get a palindrome (255346343643552).
The spelling of 114223122321141 in words is "one hundred fourteen trillion, two hundred twenty-three billion, one hundred twenty-two million, three hundred twenty-one thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •