Base | Representation |
---|---|
bin | 10100100100000011111… |
… | …111100111101010001111 |
3 | 12000002111011010021122002 |
4 | 110210003333213222033 |
5 | 141123022434441201 |
6 | 3001101354142515 |
7 | 204044133302261 |
oct | 24440377475217 |
9 | 5002434107562 |
10 | 1413111249551 |
11 | 4a532a508121 |
12 | 1a9a54121a3b |
13 | a334305a8c1 |
14 | 4c575a53b31 |
15 | 26b5923976b |
hex | 14903fe7a8f |
1413111249551 has 2 divisors, whose sum is σ = 1413111249552. Its totient is φ = 1413111249550.
The previous prime is 1413111249527. The next prime is 1413111249593. The reversal of 1413111249551 is 1559421113141.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1413111249551 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1413111279551) 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 as a sum of consecutive naturals, namely, 706555624775 + 706555624776.
It is an arithmetic number, because the mean of its divisors is an integer number (706555624776).
Almost surely, 21413111249551 is an apocalyptic number.
1413111249551 is a deficient number, since it is larger than the sum of its proper divisors (1).
1413111249551 is an equidigital number, since it uses as much as digits as its factorization.
1413111249551 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 21600, while the sum is 38.
The spelling of 1413111249551 in words is "one trillion, four hundred thirteen billion, one hundred eleven million, two hundred forty-nine thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •