Base | Representation |
---|---|
bin | 11010000010110010110000… |
… | …110100111001001000000101 |
3 | 120000120000201222220200012212 |
4 | 122002302300310321020011 |
5 | 110003120241023131341 |
6 | 1043335251400553205 |
7 | 33061216405106513 |
oct | 3202626064711005 |
9 | 500500658820185 |
10 | 114541154505221 |
11 | 335506a3700144 |
12 | 10a1aa14a82805 |
13 | 4bbb252522aa2 |
14 | 203db7011b4b3 |
15 | d397293385eb |
hex | 682cb0d39205 |
114541154505221 has 8 divisors (see below), whose sum is σ = 114929137514304. Its totient is φ = 114153754492960.
The previous prime is 114541154505199. The next prime is 114541154505257. The reversal of 114541154505221 is 122505451145411.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 114541154505221 - 214 = 114541154488837 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 (114541154505821) 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 7 ways as a sum of consecutive naturals, for example, 145355600 + ... + 146141481.
It is an arithmetic number, because the mean of its divisors is an integer number (14366142189288).
Almost surely, 2114541154505221 is an apocalyptic number.
It is an amenable number.
114541154505221 is a deficient number, since it is larger than the sum of its proper divisors (387983009083).
114541154505221 is an equidigital number, since it uses as much as digits as its factorization.
114541154505221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 291498411.
The product of its (nonzero) digits is 160000, while the sum is 41.
The spelling of 114541154505221 in words is "one hundred fourteen trillion, five hundred forty-one billion, one hundred fifty-four million, five hundred five thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •