Base | Representation |
---|---|
bin | 110101010011010001… |
… | …0000111101111100001 |
3 | 101221110010112120021111 |
4 | 1222212202013233201 |
5 | 3333410024042121 |
6 | 124330021423321 |
7 | 11161334254156 |
oct | 1524642075741 |
9 | 357403476244 |
10 | 114463112161 |
11 | 445a8496362 |
12 | 1a22556ab41 |
13 | aa42059588 |
14 | 577bc4a22d |
15 | 2e9dd4b2e1 |
hex | 1aa6887be1 |
114463112161 has 4 divisors (see below), whose sum is σ = 114489754372. Its totient is φ = 114436469952.
The previous prime is 114463112147. The next prime is 114463112177. The reversal of 114463112161 is 161211364411.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 95842872225 + 18620239936 = 309585^2 + 136456^2 .
It is a cyclic number.
It is not a de Polignac number, because 114463112161 - 27 = 114463112033 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (114463112761) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 13314660 + ... + 13323253.
It is an arithmetic number, because the mean of its divisors is an integer number (28622438593).
Almost surely, 2114463112161 is an apocalyptic number.
It is an amenable number.
114463112161 is a deficient number, since it is larger than the sum of its proper divisors (26642211).
114463112161 is an equidigital number, since it uses as much as digits as its factorization.
114463112161 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26642210.
The product of its digits is 3456, while the sum is 31.
Adding to 114463112161 its reverse (161211364411), we get a palindrome (275674476572).
The spelling of 114463112161 in words is "one hundred fourteen billion, four hundred sixty-three million, one hundred twelve thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •