Base | Representation |
---|---|
bin | 100011011011000010111… |
… | …001000010000010110101 |
3 | 22121201011001200022121021 |
4 | 203123002321002002311 |
5 | 304340241113020041 |
6 | 5102133224421141 |
7 | 340603161655603 |
oct | 43330271020265 |
9 | 8551131608537 |
10 | 2434221220021 |
11 | 8593904672a8 |
12 | 3339279177b1 |
13 | 148713963016 |
14 | 85b61958873 |
15 | 434bddc1cd1 |
hex | 236c2e420b5 |
2434221220021 has 4 divisors (see below), whose sum is σ = 2434400841132. Its totient is φ = 2434041598912.
The previous prime is 2434221220019. The next prime is 2434221220139. The reversal of 2434221220021 is 1200221224342.
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 1882411440100 + 551809779921 = 1372010^2 + 742839^2 .
It is a cyclic number.
It is not a de Polignac number, because 2434221220021 - 21 = 2434221220019 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 (2434221220421) 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, 89790226 + ... + 89817331.
It is an arithmetic number, because the mean of its divisors is an integer number (608600210283).
Almost surely, 22434221220021 is an apocalyptic number.
It is an amenable number.
2434221220021 is a deficient number, since it is larger than the sum of its proper divisors (179621111).
2434221220021 is a wasteful number, since it uses less digits than its factorization.
2434221220021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 179621110.
The product of its (nonzero) digits is 3072, while the sum is 25.
Adding to 2434221220021 its reverse (1200221224342), we get a palindrome (3634442444363).
The spelling of 2434221220021 in words is "two trillion, four hundred thirty-four billion, two hundred twenty-one million, two hundred twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •