Base | Representation |
---|---|
bin | 10100100010011001111… |
… | …101111000101101111001 |
3 | 11222220220011220212211101 |
4 | 110202121331320231321 |
5 | 141110402044111413 |
6 | 3000205051331401 |
7 | 203652063356644 |
oct | 24423175705571 |
9 | 4886804825741 |
10 | 1411332410233 |
11 | 4a45a7396889 |
12 | 1a9638450b61 |
13 | a311b669365 |
14 | 4c4476c8a5b |
15 | 26aa2eb0edd |
hex | 14899f78b79 |
1411332410233 has 16 divisors (see below), whose sum is σ = 1492550986752. Its totient is φ = 1332351648000.
The previous prime is 1411332410227. The next prime is 1411332410377. The reversal of 1411332410233 is 3320142331141.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1411332410233 is a prime.
It is a super-2 number, since 2×14113324102332 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1411332410533) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 13053988 + ... + 13161658.
It is an arithmetic number, because the mean of its divisors is an integer number (93284436672).
Almost surely, 21411332410233 is an apocalyptic number.
It is an amenable number.
1411332410233 is a deficient number, since it is larger than the sum of its proper divisors (81218576519).
1411332410233 is a wasteful number, since it uses less digits than its factorization.
1411332410233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 118056.
The product of its (nonzero) digits is 5184, while the sum is 28.
Adding to 1411332410233 its reverse (3320142331141), we get a palindrome (4731474741374).
The spelling of 1411332410233 in words is "one trillion, four hundred eleven billion, three hundred thirty-two million, four hundred ten thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.119 sec. • engine limits •