Base | Representation |
---|---|
bin | 100000000101110001101010… |
… | …100100001101100111111011 |
3 | 200111201022120220212020112012 |
4 | 200011301222210031213323 |
5 | 121444321234241140233 |
6 | 1220100130535240135 |
7 | 41504424220430042 |
oct | 4005615244154773 |
9 | 614638526766465 |
10 | 141134413224443 |
11 | 40a7384a9980a1 |
12 | 139b496551904b |
13 | 6099bc1c94172 |
14 | 26bcd28d9b559 |
15 | 114b36b263548 |
hex | 805c6a90d9fb |
141134413224443 has 2 divisors, whose sum is σ = 141134413224444. Its totient is φ = 141134413224442.
The previous prime is 141134413224403. The next prime is 141134413224449. The reversal of 141134413224443 is 344422314431141.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 141134413224443 - 26 = 141134413224379 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 141134413224443.
It is not a weakly prime, because it can be changed into another prime (141134413224449) 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, 70567206612221 + 70567206612222.
It is an arithmetic number, because the mean of its divisors is an integer number (70567206612222).
Almost surely, 2141134413224443 is an apocalyptic number.
141134413224443 is a deficient number, since it is larger than the sum of its proper divisors (1).
141134413224443 is an equidigital number, since it uses as much as digits as its factorization.
141134413224443 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 442368, while the sum is 41.
Adding to 141134413224443 its reverse (344422314431141), we get a palindrome (485556727655584).
The spelling of 141134413224443 in words is "one hundred forty-one trillion, one hundred thirty-four billion, four hundred thirteen million, two hundred twenty-four thousand, four hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •