Base | Representation |
---|---|
bin | 111010101100010101111… |
… | …000100000001100100101 |
3 | 112021120202111110112220022 |
4 | 322230111320200030211 |
5 | 1012040240401040141 |
6 | 12324520320244525 |
7 | 564253650304121 |
oct | 72542570401445 |
9 | 15246674415808 |
10 | 4033341424421 |
11 | 13155920a3291 |
12 | 551831a70745 |
13 | 23345b517b3a |
14 | dd301468581 |
15 | 6edb311ab4b |
hex | 3ab15e20325 |
4033341424421 has 8 divisors (see below), whose sum is σ = 4210680991680. Its totient is φ = 3856166598592.
The previous prime is 4033341424391. The next prime is 4033341424433. The reversal of 4033341424421 is 1244241433304.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 4033341424421 - 226 = 4033274315557 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 (4033341424121) 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, 41135315 + ... + 41233248.
It is an arithmetic number, because the mean of its divisors is an integer number (526335123960).
Almost surely, 24033341424421 is an apocalyptic number.
It is an amenable number.
4033341424421 is a deficient number, since it is larger than the sum of its proper divisors (177339567259).
4033341424421 is a wasteful number, since it uses less digits than its factorization.
4033341424421 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 82370715.
The product of its (nonzero) digits is 110592, while the sum is 35.
Adding to 4033341424421 its reverse (1244241433304), we get a palindrome (5277582857725).
The spelling of 4033341424421 in words is "four trillion, thirty-three billion, three hundred forty-one million, four hundred twenty-four thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •