Base | Representation |
---|---|
bin | 1100110101011101001110… |
… | …1111111011011010000001 |
3 | 1211222010212210101111101202 |
4 | 3031113103233323122001 |
5 | 3322204420122432113 |
6 | 50003111403510545 |
7 | 2654411255543312 |
oct | 315272357733201 |
9 | 54863783344352 |
10 | 14112520124033 |
11 | 45510a4774231 |
12 | 16bb126528455 |
13 | 7b4a605a7cb6 |
14 | 36b09a220609 |
15 | 197174399258 |
hex | cd5d3bfb681 |
14112520124033 has 2 divisors, whose sum is σ = 14112520124034. Its totient is φ = 14112520124032.
The previous prime is 14112520123997. The next prime is 14112520124077. The reversal of 14112520124033 is 33042102521141.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 13768018038784 + 344502085249 = 3710528^2 + 586943^2 .
It is a cyclic number.
It is not a de Polignac number, because 14112520124033 - 236 = 14043800647297 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 14112520123987 and 14112520124005.
It is not a weakly prime, because it can be changed into another prime (14112520121033) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7056260062016 + 7056260062017.
It is an arithmetic number, because the mean of its divisors is an integer number (7056260062017).
Almost surely, 214112520124033 is an apocalyptic number.
It is an amenable number.
14112520124033 is a deficient number, since it is larger than the sum of its proper divisors (1).
14112520124033 is an equidigital number, since it uses as much as digits as its factorization.
14112520124033 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 5760, while the sum is 29.
Adding to 14112520124033 its reverse (33042102521141), we get a palindrome (47154622645174).
The spelling of 14112520124033 in words is "fourteen trillion, one hundred twelve billion, five hundred twenty million, one hundred twenty-four thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •