Base | Representation |
---|---|
bin | 1100001101110011111110… |
… | …1001001101010000101101 |
3 | 1202120000212111002210200112 |
4 | 3003130333221031100231 |
5 | 3230030032202021141 |
6 | 44322151453305405 |
7 | 2554250240351342 |
oct | 303347751152055 |
9 | 52500774083615 |
10 | 13431430501421 |
11 | 43092683a7aa9 |
12 | 160b126a95265 |
13 | 765769b5959a |
14 | 3461286047c9 |
15 | 1845b05767eb |
hex | c373fa4d42d |
13431430501421 has 2 divisors, whose sum is σ = 13431430501422. Its totient is φ = 13431430501420.
The previous prime is 13431430501343. The next prime is 13431430501441. The reversal of 13431430501421 is 12410503413431.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8130909675625 + 5300520825796 = 2851475^2 + 2302286^2 .
It is an emirp because it is prime and its reverse (12410503413431) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 13431430501421 - 238 = 13156552594477 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13431430501441) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6715715250710 + 6715715250711.
It is an arithmetic number, because the mean of its divisors is an integer number (6715715250711).
Almost surely, 213431430501421 is an apocalyptic number.
It is an amenable number.
13431430501421 is a deficient number, since it is larger than the sum of its proper divisors (1).
13431430501421 is an equidigital number, since it uses as much as digits as its factorization.
13431430501421 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 17280, while the sum is 32.
Adding to 13431430501421 its reverse (12410503413431), we get a palindrome (25841933914852).
The spelling of 13431430501421 in words is "thirteen trillion, four hundred thirty-one billion, four hundred thirty million, five hundred one thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •