Base | Representation |
---|---|
bin | 11001111011101010010010… |
… | …001001100010111111011101 |
3 | 112221211011121020020112120100 |
4 | 121323222102021202333131 |
5 | 104422102433432213031 |
6 | 1042322151243211313 |
7 | 33010625302551036 |
oct | 3173522211427735 |
9 | 487734536215510 |
10 | 114051013554141 |
11 | 33381843936064 |
12 | 1095ba25816b39 |
13 | 4b83c6cb11291 |
14 | 2024154449a8d |
15 | d2bade01ede6 |
hex | 67ba92262fdd |
114051013554141 has 24 divisors (see below), whose sum is σ = 165862333203840. Its totient is φ = 75516916546656.
The previous prime is 114051013554073. The next prime is 114051013554167. The reversal of 114051013554141 is 141455310150411.
114051013554141 is a `hidden beast` number, since 1 + 1 + 4 + 0 + 5 + 101 + 3 + 5 + 541 + 4 + 1 = 666.
It is not a de Polignac number, because 114051013554141 - 214 = 114051013537757 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 114051013554096 and 114051013554105.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (114051013554241) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 29184826 + ... + 32861163.
It is an arithmetic number, because the mean of its divisors is an integer number (6910930550160).
Almost surely, 2114051013554141 is an apocalyptic number.
It is an amenable number.
114051013554141 is a deficient number, since it is larger than the sum of its proper divisors (51811319649699).
114051013554141 is a wasteful number, since it uses less digits than its factorization.
114051013554141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 62047385 (or 62047382 counting only the distinct ones).
The product of its (nonzero) digits is 24000, while the sum is 36.
The spelling of 114051013554141 in words is "one hundred fourteen trillion, fifty-one billion, thirteen million, five hundred fifty-four thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •