Base | Representation |
---|---|
bin | 1101000101110011101000… |
… | …0000100111001010100001 |
3 | 1212221222220101200221102022 |
4 | 3101130322000213022201 |
5 | 3341310200103212331 |
6 | 50340123551431225 |
7 | 3013614040602326 |
oct | 321347200471241 |
9 | 55858811627368 |
10 | 14393408647841 |
11 | 464a234a45603 |
12 | 1745657525515 |
13 | 8053a5b37bc2 |
14 | 37a90508ab4d |
15 | 19e613ced67b |
hex | d173a0272a1 |
14393408647841 has 2 divisors, whose sum is σ = 14393408647842. Its totient is φ = 14393408647840.
The previous prime is 14393408647801. The next prime is 14393408647859. The reversal of 14393408647841 is 14874680439341.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 13346052900625 + 1047355747216 = 3653225^2 + 1023404^2 .
It is a cyclic number.
It is not a de Polignac number, because 14393408647841 - 222 = 14393404453537 is a prime.
It is a super-2 number, since 2×143934086478412 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (14393408647801) 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, 7196704323920 + 7196704323921.
It is an arithmetic number, because the mean of its divisors is an integer number (7196704323921).
Almost surely, 214393408647841 is an apocalyptic number.
It is an amenable number.
14393408647841 is a deficient number, since it is larger than the sum of its proper divisors (1).
14393408647841 is an equidigital number, since it uses as much as digits as its factorization.
14393408647841 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 55738368, while the sum is 62.
The spelling of 14393408647841 in words is "fourteen trillion, three hundred ninety-three billion, four hundred eight million, six hundred forty-seven thousand, eight hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •