Base | Representation |
---|---|
bin | 100011001110111101011… |
… | …001011000110000110111 |
3 | 22120110122200000011122101 |
4 | 203032331121120300313 |
5 | 304132201444332003 |
6 | 5052145412442531 |
7 | 336633454405063 |
oct | 43167531306067 |
9 | 8513580004571 |
10 | 2421244136503 |
11 | 853931214395 |
12 | 331305919447 |
13 | 14742625608a |
14 | 85290276aa3 |
15 | 42eae99a11d |
hex | 233bd658c37 |
2421244136503 has 4 divisors (see below), whose sum is σ = 2427282152208. Its totient is φ = 2415206120800.
The previous prime is 2421244136473. The next prime is 2421244136513. The reversal of 2421244136503 is 3056314421242.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 2421244136503 - 29 = 2421244135991 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 (2421244136513) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3019007251 + ... + 3019008052.
It is an arithmetic number, because the mean of its divisors is an integer number (606820538052).
Almost surely, 22421244136503 is an apocalyptic number.
2421244136503 is a deficient number, since it is larger than the sum of its proper divisors (6038015705).
2421244136503 is an equidigital number, since it uses as much as digits as its factorization.
2421244136503 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6038015704.
The product of its (nonzero) digits is 138240, while the sum is 37.
Adding to 2421244136503 its reverse (3056314421242), we get a palindrome (5477558557745).
The spelling of 2421244136503 in words is "two trillion, four hundred twenty-one billion, two hundred forty-four million, one hundred thirty-six thousand, five hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •