Base | Representation |
---|---|
bin | 11111001010010000110… |
… | …111101100001100001101 |
3 | 21120201010120022122202001 |
4 | 133022100313230030031 |
5 | 240040413000401222 |
6 | 4315413305432301 |
7 | 310464003436306 |
oct | 37122067541415 |
9 | 7521116278661 |
10 | 2141324231437 |
11 | 756148782676 |
12 | 2a700519b691 |
13 | 126c06596761 |
14 | 758d7d097ad |
15 | 3aa7a0c8e27 |
hex | 1f290dec30d |
2141324231437 has 2 divisors, whose sum is σ = 2141324231438. Its totient is φ = 2141324231436.
The previous prime is 2141324231401. The next prime is 2141324231461. The reversal of 2141324231437 is 7341324231412.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1501749760681 + 639574470756 = 1225459^2 + 799734^2 .
It is a cyclic number.
It is not a de Polignac number, because 2141324231437 - 223 = 2141315842829 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2141324231396 and 2141324231405.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2141324231237) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1070662115718 + 1070662115719.
It is an arithmetic number, because the mean of its divisors is an integer number (1070662115719).
Almost surely, 22141324231437 is an apocalyptic number.
It is an amenable number.
2141324231437 is a deficient number, since it is larger than the sum of its proper divisors (1).
2141324231437 is an equidigital number, since it uses as much as digits as its factorization.
2141324231437 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 96768, while the sum is 37.
Adding to 2141324231437 its reverse (7341324231412), we get a palindrome (9482648462849).
The spelling of 2141324231437 in words is "two trillion, one hundred forty-one billion, three hundred twenty-four million, two hundred thirty-one thousand, four hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •