Base | Representation |
---|---|
bin | 11001011110000001011101… |
… | …110101001101111001011011 |
3 | 112200121110112122110121221001 |
4 | 121132001131311031321123 |
5 | 104140220312223430243 |
6 | 1034122400244125431 |
7 | 32410524206253064 |
oct | 3136013565157133 |
9 | 480543478417831 |
10 | 112014321311323 |
11 | 3276700919a162 |
12 | 10691161696877 |
13 | 4a66b9c894732 |
14 | 1d9374482756b |
15 | ce3b39b41a4d |
hex | 65e05dd4de5b |
112014321311323 has 32 divisors (see below), whose sum is σ = 120609547720704. Its totient is φ = 103782892067712.
The previous prime is 112014321311267. The next prime is 112014321311329. The reversal of 112014321311323 is 323113123410211.
It is a happy number.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-112014321311323 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 112014321311291 and 112014321311300.
It is not an unprimeable number, because it can be changed into a prime (112014321311329) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 143585865 + ... + 144363877.
It is an arithmetic number, because the mean of its divisors is an integer number (3769048366272).
Almost surely, 2112014321311323 is an apocalyptic number.
112014321311323 is a deficient number, since it is larger than the sum of its proper divisors (8595226409381).
112014321311323 is a wasteful number, since it uses less digits than its factorization.
112014321311323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 779595.
The product of its (nonzero) digits is 2592, while the sum is 28.
Adding to 112014321311323 its reverse (323113123410211), we get a palindrome (435127444721534).
The spelling of 112014321311323 in words is "one hundred twelve trillion, fourteen billion, three hundred twenty-one million, three hundred eleven thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •