Base | Representation |
---|---|
bin | 111100010000101100111… |
… | …111011111100001001101 |
3 | 112122212220121110210100122 |
4 | 330100230333133201031 |
5 | 1020321434422040041 |
6 | 12450221355434325 |
7 | 605120254253231 |
oct | 74205477374115 |
9 | 15585817423318 |
10 | 4141103315021 |
11 | 1357260954702 |
12 | 56a6a71559a5 |
13 | 24067312c24a |
14 | 1046052d05c1 |
15 | 72abd9b9c4b |
hex | 3c42cfdf84d |
4141103315021 has 4 divisors (see below), whose sum is σ = 4182104338044. Its totient is φ = 4100102292000.
The previous prime is 4141103315017. The next prime is 4141103315081. The reversal of 4141103315021 is 1205133011414.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 3159044116900 + 982059198121 = 1777370^2 + 990989^2 .
It is a cyclic number.
It is not a de Polignac number, because 4141103315021 - 22 = 4141103315017 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4141103315081) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 20500511360 + ... + 20500511561.
It is an arithmetic number, because the mean of its divisors is an integer number (1045526084511).
Almost surely, 24141103315021 is an apocalyptic number.
It is an amenable number.
4141103315021 is a deficient number, since it is larger than the sum of its proper divisors (41001023023).
4141103315021 is a wasteful number, since it uses less digits than its factorization.
4141103315021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 41001023022.
The product of its (nonzero) digits is 1440, while the sum is 26.
Adding to 4141103315021 its reverse (1205133011414), we get a palindrome (5346236326435).
The spelling of 4141103315021 in words is "four trillion, one hundred forty-one billion, one hundred three million, three hundred fifteen thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •