Base | Representation |
---|---|
bin | 10100100100000100000… |
… | …111100111101010111111 |
3 | 12000002111022001211110011 |
4 | 110210010013213222333 |
5 | 141123024004044001 |
6 | 3001101511124051 |
7 | 204044160155461 |
oct | 24440407475277 |
9 | 5002438054404 |
10 | 1413113346751 |
11 | 4a533070a847 |
12 | 1a9a54973627 |
13 | a3343613352 |
14 | 4c57603c131 |
15 | 26b59500d51 |
hex | 149041e7abf |
1413113346751 has 8 divisors (see below), whose sum is σ = 1418328095184. Its totient is φ = 1407903057600.
The previous prime is 1413113346739. The next prime is 1413113346763. The reversal of 1413113346751 is 1576433113141.
It is an interprime number because it is at equal distance from previous prime (1413113346739) and next prime (1413113346763).
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 1413113346751 - 25 = 1413113346719 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1413113346791) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 479200 + ... + 1748101.
It is an arithmetic number, because the mean of its divisors is an integer number (177291011898).
Almost surely, 21413113346751 is an apocalyptic number.
1413113346751 is a deficient number, since it is larger than the sum of its proper divisors (5214748433).
1413113346751 is a wasteful number, since it uses less digits than its factorization.
1413113346751 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2229641.
The product of its digits is 90720, while the sum is 40.
Adding to 1413113346751 its reverse (1576433113141), we get a palindrome (2989546459892).
The spelling of 1413113346751 in words is "one trillion, four hundred thirteen billion, one hundred thirteen million, three hundred forty-six thousand, seven hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.102 sec. • engine limits •