Base | Representation |
---|---|
bin | 10100100010011010100… |
… | …111001010010001011011 |
3 | 11222220220221021120211002 |
4 | 110202122213022101123 |
5 | 141110412331330133 |
6 | 3000210115255215 |
7 | 203652254342405 |
oct | 24423247122133 |
9 | 4886827246732 |
10 | 1411343230043 |
11 | 4a460250697a |
12 | 1a963bbaa50b |
13 | a3120987106 |
14 | 4c448d03b75 |
15 | 26aa3debce8 |
hex | 1489a9ca45b |
1411343230043 has 16 divisors (see below), whose sum is σ = 1461556183584. Its totient is φ = 1362164981760.
The previous prime is 1411343230021. The next prime is 1411343230049. The reversal of 1411343230043 is 3400323431141.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 1411343230043 - 210 = 1411343229019 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1411343229988 and 1411343230015.
It is not an unprimeable number, because it can be changed into a prime (1411343230049) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 378521 + ... + 1722197.
It is an arithmetic number, because the mean of its divisors is an integer number (91347261474).
Almost surely, 21411343230043 is an apocalyptic number.
1411343230043 is a deficient number, since it is larger than the sum of its proper divisors (50212953541).
1411343230043 is a wasteful number, since it uses less digits than its factorization.
1411343230043 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1344062.
The product of its (nonzero) digits is 10368, while the sum is 29.
Adding to 1411343230043 its reverse (3400323431141), we get a palindrome (4811666661184).
The spelling of 1411343230043 in words is "one trillion, four hundred eleven billion, three hundred forty-three million, two hundred thirty thousand, forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •