Base | Representation |
---|---|
bin | 10100100010100100000… |
… | …011000100111111111101 |
3 | 11222221022222011201221112 |
4 | 110202210003010333331 |
5 | 141111223343342141 |
6 | 3000233532411405 |
7 | 203656216105424 |
oct | 24424403047775 |
9 | 4887288151845 |
10 | 1411501543421 |
11 | 4a4683907082 |
12 | 1a9685016b65 |
13 | a3147706c78 |
14 | 4c461d542bb |
15 | 26ab2c6e7eb |
hex | 148a40c4ffd |
1411501543421 has 2 divisors, whose sum is σ = 1411501543422. Its totient is φ = 1411501543420.
The previous prime is 1411501543339. The next prime is 1411501543453. The reversal of 1411501543421 is 1243451051141.
It is an a-pointer prime, because the next prime (1411501543453) can be obtained adding 1411501543421 to its sum of digits (32).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 899974768900 + 511526774521 = 948670^2 + 715211^2 .
It is a cyclic number.
It is not a de Polignac number, because 1411501543421 - 222 = 1411497349117 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1411501543471) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 705750771710 + 705750771711.
It is an arithmetic number, because the mean of its divisors is an integer number (705750771711).
Almost surely, 21411501543421 is an apocalyptic number.
It is an amenable number.
1411501543421 is a deficient number, since it is larger than the sum of its proper divisors (1).
1411501543421 is an equidigital number, since it uses as much as digits as its factorization.
1411501543421 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 9600, while the sum is 32.
Adding to 1411501543421 its reverse (1243451051141), we get a palindrome (2654952594562).
The spelling of 1411501543421 in words is "one trillion, four hundred eleven billion, five hundred one million, five hundred forty-three thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •