Base | Representation |
---|---|
bin | 100011001111000110101… |
… | …100000111011101010101 |
3 | 22120111001112100221211011 |
4 | 203033012230013131111 |
5 | 304133011402310201 |
6 | 5052213102212221 |
7 | 336640356520033 |
oct | 43170654073525 |
9 | 8514045327734 |
10 | 2421400041301 |
11 | 853a01219a2a |
12 | 331349b84071 |
13 | 14744c641837 |
14 | 852a6c5b553 |
15 | 42ebd4e4151 |
hex | 233c6b07755 |
2421400041301 has 2 divisors, whose sum is σ = 2421400041302. Its totient is φ = 2421400041300.
The previous prime is 2421400041233. The next prime is 2421400041323. The reversal of 2421400041301 is 1031400041242.
It is a happy number.
It is an a-pointer prime, because the next prime (2421400041323) can be obtained adding 2421400041301 to its sum of digits (22).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2147253553201 + 274146488100 = 1465351^2 + 523590^2 .
It is a cyclic number.
It is not a de Polignac number, because 2421400041301 - 27 = 2421400041173 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2421400041331) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1210700020650 + 1210700020651.
It is an arithmetic number, because the mean of its divisors is an integer number (1210700020651).
Almost surely, 22421400041301 is an apocalyptic number.
It is an amenable number.
2421400041301 is a deficient number, since it is larger than the sum of its proper divisors (1).
2421400041301 is an equidigital number, since it uses as much as digits as its factorization.
2421400041301 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 768, while the sum is 22.
Adding to 2421400041301 its reverse (1031400041242), we get a palindrome (3452800082543).
The spelling of 2421400041301 in words is "two trillion, four hundred twenty-one billion, four hundred million, forty-one thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •