Base | Representation |
---|---|
bin | 10100100100010001000… |
… | …101111100010111100011 |
3 | 12000010001110122022201121 |
4 | 110210101011330113203 |
5 | 141124000214323133 |
6 | 3001135244313111 |
7 | 204052442243320 |
oct | 24442105742743 |
9 | 5003043568647 |
10 | 1413331011043 |
11 | 4a5432568196 |
12 | 1a9ab5842797 |
13 | a33797438a3 |
14 | 4c596cdbb47 |
15 | 26b6d69902d |
hex | 1491117c5e3 |
1413331011043 has 8 divisors (see below), whose sum is σ = 1616715959040. Its totient is φ = 1210316192520.
The previous prime is 1413331011031. The next prime is 1413331011061. The reversal of 1413331011043 is 3401101333141.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1413331011043 - 25 = 1413331011011 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1413331010999 and 1413331011017.
It is not an unprimeable number, because it can be changed into a prime (1413331011643) 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 7 ways as a sum of consecutive naturals, for example, 92524183 + ... + 92539456.
It is an arithmetic number, because the mean of its divisors is an integer number (202089494880).
Almost surely, 21413331011043 is an apocalyptic number.
1413331011043 is a deficient number, since it is larger than the sum of its proper divisors (203384947997).
1413331011043 is a wasteful number, since it uses less digits than its factorization.
1413331011043 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 185064737.
The product of its (nonzero) digits is 1296, while the sum is 25.
Adding to 1413331011043 its reverse (3401101333141), we get a palindrome (4814432344184).
The spelling of 1413331011043 in words is "one trillion, four hundred thirteen billion, three hundred thirty-one million, eleven thousand, forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •