Base | Representation |
---|---|
bin | 10010001000101001100… |
… | …101010000101100101101 |
3 | 11102010202110221110202002 |
4 | 102020221211100230231 |
5 | 130404243431240141 |
6 | 2352303000342045 |
7 | 156015641326256 |
oct | 22105145205455 |
9 | 4363673843662 |
10 | 1246238149421 |
11 | 440587a45121 |
12 | 181642774925 |
13 | 9069ab89735 |
14 | 444653b7b2d |
15 | 2263e19ce9b |
hex | 12229950b2d |
1246238149421 has 2 divisors, whose sum is σ = 1246238149422. Its totient is φ = 1246238149420.
The previous prime is 1246238149397. The next prime is 1246238149451. The reversal of 1246238149421 is 1249418326421.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1081007281225 + 165230868196 = 1039715^2 + 406486^2 .
It is an emirp because it is prime and its reverse (1249418326421) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1246238149421 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1246238149451) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 623119074710 + 623119074711.
It is an arithmetic number, because the mean of its divisors is an integer number (623119074711).
Almost surely, 21246238149421 is an apocalyptic number.
It is an amenable number.
1246238149421 is a deficient number, since it is larger than the sum of its proper divisors (1).
1246238149421 is an equidigital number, since it uses as much as digits as its factorization.
1246238149421 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 663552, while the sum is 47.
The spelling of 1246238149421 in words is "one trillion, two hundred forty-six billion, two hundred thirty-eight million, one hundred forty-nine thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •