Base | Representation |
---|---|
bin | 11101111000010100111011… |
… | …000000110010111011001011 |
3 | 122020022001202212221212012012 |
4 | 131320110323000302323023 |
5 | 114211042041212420133 |
6 | 1143254450043210135 |
7 | 36452233005021614 |
oct | 3570247300627313 |
9 | 566261685855165 |
10 | 131414104420043 |
11 | 38966454a94005 |
12 | 128a4b2581694b |
13 | 58433b22cb523 |
14 | 2464695aa2c0b |
15 | 102d5b0ab5b48 |
hex | 77853b032ecb |
131414104420043 has 2 divisors, whose sum is σ = 131414104420044. Its totient is φ = 131414104420042.
The previous prime is 131414104420013. The next prime is 131414104420057. The reversal of 131414104420043 is 340024401414131.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-131414104420043 is a prime.
It is a super-3 number, since 3×1314141044200433 (a number of 43 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 131414104419991 and 131414104420009.
It is not a weakly prime, because it can be changed into another prime (131414104420013) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65707052210021 + 65707052210022.
It is an arithmetic number, because the mean of its divisors is an integer number (65707052210022).
Almost surely, 2131414104420043 is an apocalyptic number.
131414104420043 is a deficient number, since it is larger than the sum of its proper divisors (1).
131414104420043 is an equidigital number, since it uses as much as digits as its factorization.
131414104420043 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 18432, while the sum is 32.
Adding to 131414104420043 its reverse (340024401414131), we get a palindrome (471438505834174).
The spelling of 131414104420043 in words is "one hundred thirty-one trillion, four hundred fourteen billion, one hundred four million, four hundred twenty thousand, forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •