Base | Representation |
---|---|
bin | 100000000111010101000010… |
… | …111110101000011000000011 |
3 | 200112002112000201120212112002 |
4 | 200013111002332220120003 |
5 | 122003043310022243043 |
6 | 1220221135401254215 |
7 | 41515222462554302 |
oct | 4007250276503003 |
9 | 615075021525462 |
10 | 141241123243523 |
11 | 41005029a16906 |
12 | 13a1158649436b |
13 | 60a6c999a91a4 |
14 | 26c416d252439 |
15 | 114e0145d6bb8 |
hex | 807542fa8603 |
141241123243523 has 2 divisors, whose sum is σ = 141241123243524. Its totient is φ = 141241123243522.
The previous prime is 141241123243477. The next prime is 141241123243537. The reversal of 141241123243523 is 325342321142141.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-141241123243523 is a prime.
It is a super-2 number, since 2×1412411232435232 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (141241123243223) 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 as a sum of consecutive naturals, namely, 70620561621761 + 70620561621762.
It is an arithmetic number, because the mean of its divisors is an integer number (70620561621762).
Almost surely, 2141241123243523 is an apocalyptic number.
141241123243523 is a deficient number, since it is larger than the sum of its proper divisors (1).
141241123243523 is an equidigital number, since it uses as much as digits as its factorization.
141241123243523 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 138240, while the sum is 38.
Adding to 141241123243523 its reverse (325342321142141), we get a palindrome (466583444385664).
The spelling of 141241123243523 in words is "one hundred forty-one trillion, two hundred forty-one billion, one hundred twenty-three million, two hundred forty-three thousand, five hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •