Base | Representation |
---|---|
bin | 1100111101000000100011… |
… | …0111101000001001101111 |
3 | 1212102112202121112001001011 |
4 | 3033100020313220021233 |
5 | 3331321122122304042 |
6 | 50142445403130051 |
7 | 2666653326363514 |
oct | 317201067501157 |
9 | 55375677461034 |
10 | 14242260353647 |
11 | 45a1121746a97 |
12 | 17202b4213927 |
13 | 7c40686c8c31 |
14 | 373486dc930b |
15 | 19a7194e8a17 |
hex | cf408de826f |
14242260353647 has 2 divisors, whose sum is σ = 14242260353648. Its totient is φ = 14242260353646.
The previous prime is 14242260353609. The next prime is 14242260353663. The reversal of 14242260353647 is 74635306224241.
14242260353647 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-14242260353647 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 14242260353647.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (14242260353687) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7121130176823 + 7121130176824.
It is an arithmetic number, because the mean of its divisors is an integer number (7121130176824).
Almost surely, 214242260353647 is an apocalyptic number.
14242260353647 is a deficient number, since it is larger than the sum of its proper divisors (1).
14242260353647 is an equidigital number, since it uses as much as digits as its factorization.
14242260353647 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 5806080, while the sum is 49.
Adding to 14242260353647 its reverse (74635306224241), we get a palindrome (88877566577888).
The spelling of 14242260353647 in words is "fourteen trillion, two hundred forty-two billion, two hundred sixty million, three hundred fifty-three thousand, six hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •