Base | Representation |
---|---|
bin | 1100110010000001100011… |
… | …1000011100011111111101 |
3 | 1211202111200002112021212111 |
4 | 3030200120320130133331 |
5 | 3320223132403124433 |
6 | 45520040102534021 |
7 | 2650223036532442 |
oct | 314403070343775 |
9 | 54674602467774 |
10 | 14053550442493 |
11 | 4529093938731 |
12 | 16ab809737311 |
13 | 7ac323441c03 |
14 | 3682a452b9c9 |
15 | 195872315dcd |
hex | cc818e1c7fd |
14053550442493 has 2 divisors, whose sum is σ = 14053550442494. Its totient is φ = 14053550442492.
The previous prime is 14053550442469. The next prime is 14053550442523. The reversal of 14053550442493 is 39424405535041.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 13514468497209 + 539081945284 = 3676203^2 + 734222^2 .
It is a cyclic number.
It is not a de Polignac number, because 14053550442493 - 221 = 14053548345341 is a prime.
It is a super-2 number, since 2×140535504424932 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (14053550442403) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7026775221246 + 7026775221247.
It is an arithmetic number, because the mean of its divisors is an integer number (7026775221247).
Almost surely, 214053550442493 is an apocalyptic number.
It is an amenable number.
14053550442493 is a deficient number, since it is larger than the sum of its proper divisors (1).
14053550442493 is an equidigital number, since it uses as much as digits as its factorization.
14053550442493 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5184000, while the sum is 49.
The spelling of 14053550442493 in words is "fourteen trillion, fifty-three billion, five hundred fifty million, four hundred forty-two thousand, four hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •