Base | Representation |
---|---|
bin | 10100100010011000001… |
… | …110111110001000101001 |
3 | 11222220211011012200100012 |
4 | 110202120032332020221 |
5 | 141110322123200231 |
6 | 3000202132221305 |
7 | 203651261260610 |
oct | 24423016761051 |
9 | 4886734180305 |
10 | 1411303334441 |
11 | 4a4591a37800 |
12 | 1a962a76a835 |
13 | a3115628c50 |
14 | 4c4438ba877 |
15 | 26aa066ae2b |
hex | 148983be229 |
1411303334441 has 192 divisors, whose sum is σ = 1987729390080. Its totient is φ = 974578176000.
The previous prime is 1411303334437. The next prime is 1411303334447. The reversal of 1411303334441 is 1444333031141.
It is not a de Polignac number, because 1411303334441 - 22 = 1411303334437 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1411303334398 and 1411303334407.
It is not an unprimeable number, because it can be changed into a prime (1411303334447) by changing a digit.
It is a polite number, since it can be written in 191 ways as a sum of consecutive naturals, for example, 8989193135 + ... + 8989193291.
It is an arithmetic number, because the mean of its divisors is an integer number (10352757240).
Almost surely, 21411303334441 is an apocalyptic number.
1411303334441 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1411303334441 is a deficient number, since it is larger than the sum of its proper divisors (576426055639).
1411303334441 is a wasteful number, since it uses less digits than its factorization.
1411303334441 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 496 (or 485 counting only the distinct ones).
The product of its (nonzero) digits is 20736, while the sum is 32.
Adding to 1411303334441 its reverse (1444333031141), we get a palindrome (2855636365582).
The spelling of 1411303334441 in words is "one trillion, four hundred eleven billion, three hundred three million, three hundred thirty-four thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •