Base | Representation |
---|---|
bin | 110101001110101101… |
… | …1101110100010110101 |
3 | 101221001111021002000021 |
4 | 1222131123232202311 |
5 | 3333101433104031 |
6 | 124302525245141 |
7 | 11154501501151 |
oct | 1523533564265 |
9 | 357044232007 |
10 | 114310441141 |
11 | 4452a29a366 |
12 | 1a1a24037b1 |
13 | aa195339b0 |
14 | 5765868061 |
15 | 2e90740511 |
hex | 1a9d6ee8b5 |
114310441141 has 8 divisors (see below), whose sum is σ = 123232740120. Its totient is φ = 105406597632.
The previous prime is 114310441039. The next prime is 114310441151. The reversal of 114310441141 is 141144013411.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 35343025 + 114275098116 = 5945^2 + 338046^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-114310441141 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (114310441151) 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, 4600996 + ... + 4625773.
It is an arithmetic number, because the mean of its divisors is an integer number (15404092515).
Almost surely, 2114310441141 is an apocalyptic number.
It is an amenable number.
114310441141 is a deficient number, since it is larger than the sum of its proper divisors (8922298979).
114310441141 is an equidigital number, since it uses as much as digits as its factorization.
114310441141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9227735.
The product of its (nonzero) digits is 768, while the sum is 25.
Adding to 114310441141 its reverse (141144013411), we get a palindrome (255454454552).
The spelling of 114310441141 in words is "one hundred fourteen billion, three hundred ten million, four hundred forty-one thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •