Base | Representation |
---|---|
bin | 11001111101001001101011… |
… | …010100011110000010110111 |
3 | 112222011221222121011020001102 |
4 | 121331021223110132002313 |
5 | 104430242221434234033 |
6 | 1042441211133520315 |
7 | 33021212456321330 |
oct | 3175115324360267 |
9 | 488157877136042 |
10 | 114153441321143 |
11 | 33411225719474 |
12 | 1097785064309b |
13 | 4b908145ac133 |
14 | 20290adab7287 |
15 | d2e5d6467de8 |
hex | 67d26b51e0b7 |
114153441321143 has 16 divisors (see below), whose sum is σ = 131168867537664. Its totient is φ = 97315994816640.
The previous prime is 114153441321131. The next prime is 114153441321167. The reversal of 114153441321143 is 341123144351411.
It is a cyclic number.
It is not a de Polignac number, because 114153441321143 - 26 = 114153441321079 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 114153441321097 and 114153441321106.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (114153441321173) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 41662505 + ... + 44317842.
It is an arithmetic number, because the mean of its divisors is an integer number (8198054221104).
Almost surely, 2114153441321143 is an apocalyptic number.
114153441321143 is a deficient number, since it is larger than the sum of its proper divisors (17015426216521).
114153441321143 is an equidigital number, since it uses as much as digits as its factorization.
114153441321143 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 85981382.
The product of its digits is 69120, while the sum is 38.
Adding to 114153441321143 its reverse (341123144351411), we get a palindrome (455276585672554).
The spelling of 114153441321143 in words is "one hundred fourteen trillion, one hundred fifty-three billion, four hundred forty-one million, three hundred twenty-one thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •