Base | Representation |
---|---|
bin | 1100110101011111001001… |
… | …0110011111111001001101 |
3 | 1211222012012120111022101112 |
4 | 3031113302112133321031 |
5 | 3322211443042121222 |
6 | 50003234344221405 |
7 | 2654430061603232 |
oct | 315276226377115 |
9 | 54865176438345 |
10 | 14113033551437 |
11 | 45513385718a7 |
12 | 16bb24a46a865 |
13 | 7b4b12a819b2 |
14 | 36b1084ad789 |
15 | 1971a44b5be2 |
hex | cd5f259fe4d |
14113033551437 has 2 divisors, whose sum is σ = 14113033551438. Its totient is φ = 14113033551436.
The previous prime is 14113033551391. The next prime is 14113033551511. The reversal of 14113033551437 is 73415533031141.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10664365421956 + 3448668129481 = 3265634^2 + 1857059^2 .
It is a cyclic number.
It is not a de Polignac number, because 14113033551437 - 28 = 14113033551181 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 14113033551394 and 14113033551403.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (14113033551137) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7056516775718 + 7056516775719.
It is an arithmetic number, because the mean of its divisors is an integer number (7056516775719).
Almost surely, 214113033551437 is an apocalyptic number.
It is an amenable number.
14113033551437 is a deficient number, since it is larger than the sum of its proper divisors (1).
14113033551437 is an equidigital number, since it uses as much as digits as its factorization.
14113033551437 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 226800, while the sum is 41.
Adding to 14113033551437 its reverse (73415533031141), we get a palindrome (87528566582578).
The spelling of 14113033551437 in words is "fourteen trillion, one hundred thirteen billion, thirty-three million, five hundred fifty-one thousand, four hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •