Base | Representation |
---|---|
bin | 111100010000101110001… |
… | …100001010100001111101 |
3 | 112122212222000021221011111 |
4 | 330100232030022201331 |
5 | 1020322010043223031 |
6 | 12450223354322021 |
7 | 605120620144240 |
oct | 74205614124175 |
9 | 15585860257144 |
10 | 4141123414141 |
11 | 135727123244a |
12 | 56a6b1a29311 |
13 | 24067734880c |
14 | 104607c43257 |
15 | 72ac063a1b1 |
hex | 3c42e30a87d |
4141123414141 has 16 divisors (see below), whose sum is σ = 4848420769920. Its totient is φ = 3462763000320.
The previous prime is 4141123414069. The next prime is 4141123414147. The reversal of 4141123414141 is 1414143211414.
It is a cyclic number.
It is not a de Polignac number, because 4141123414141 - 29 = 4141123413629 is a prime.
It is a super-2 number, since 2×41411234141412 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4141123414147) 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, 4746325 + ... + 5550661.
It is an arithmetic number, because the mean of its divisors is an integer number (303026298120).
Almost surely, 24141123414141 is an apocalyptic number.
4141123414141 is a gapful number since it is divisible by the number (41) formed by its first and last digit.
It is an amenable number.
4141123414141 is a deficient number, since it is larger than the sum of its proper divisors (707297355779).
4141123414141 is a wasteful number, since it uses less digits than its factorization.
4141123414141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 822324.
The product of its digits is 6144, while the sum is 31.
Adding to 4141123414141 its reverse (1414143211414), we get a palindrome (5555266625555).
The spelling of 4141123414141 in words is "four trillion, one hundred forty-one billion, one hundred twenty-three million, four hundred fourteen thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •