Base | Representation |
---|---|
bin | 111100010000101000101… |
… | …000010001111001101101 |
3 | 112122212201111202011010112 |
4 | 330100220220101321231 |
5 | 1020321312202333234 |
6 | 12450210222545405 |
7 | 605115405154622 |
oct | 74205050217155 |
9 | 15585644664115 |
10 | 4141030121069 |
11 | 1357223601a36 |
12 | 56a686738265 |
13 | 240660c12a0a |
14 | 1045d96ba349 |
15 | 72ab735cace |
hex | 3c428a11e6d |
4141030121069 has 2 divisors, whose sum is σ = 4141030121070. Its totient is φ = 4141030121068.
The previous prime is 4141030121009. The next prime is 4141030121131. The reversal of 4141030121069 is 9601210301414.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2685134495044 + 1455895626025 = 1638638^2 + 1206605^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-4141030121069 is a prime.
It is a super-2 number, since 2×41410301210692 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4141030121009) 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 as a sum of consecutive naturals, namely, 2070515060534 + 2070515060535.
It is an arithmetic number, because the mean of its divisors is an integer number (2070515060535).
Almost surely, 24141030121069 is an apocalyptic number.
It is an amenable number.
4141030121069 is a deficient number, since it is larger than the sum of its proper divisors (1).
4141030121069 is an equidigital number, since it uses as much as digits as its factorization.
4141030121069 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5184, while the sum is 32.
The spelling of 4141030121069 in words is "four trillion, one hundred forty-one billion, thirty million, one hundred twenty-one thousand, sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •