Base | Representation |
---|---|
bin | 1100110001011111111001… |
… | …0010000101001101010101 |
3 | 1211201122100100022211001111 |
4 | 3030113332102011031111 |
5 | 3320101131121242123 |
6 | 45511543305455021 |
7 | 2646453104233633 |
oct | 314277622051525 |
9 | 54648310284044 |
10 | 14044514243413 |
11 | 4525277172605 |
12 | 16a9b074a1471 |
13 | 7ab513329154 |
14 | 367a883b2353 |
15 | 1954e3d8890d |
hex | cc5fe485355 |
14044514243413 has 2 divisors, whose sum is σ = 14044514243414. Its totient is φ = 14044514243412.
The previous prime is 14044514243399. The next prime is 14044514243491. The reversal of 14044514243413 is 31434241544041.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 13758928745809 + 285585497604 = 3709303^2 + 534402^2 .
It is a cyclic number.
It is not a de Polignac number, because 14044514243413 - 29 = 14044514242901 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (14044514249413) 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, 7022257121706 + 7022257121707.
It is an arithmetic number, because the mean of its divisors is an integer number (7022257121707).
Almost surely, 214044514243413 is an apocalyptic number.
It is an amenable number.
14044514243413 is a deficient number, since it is larger than the sum of its proper divisors (1).
14044514243413 is an equidigital number, since it uses as much as digits as its factorization.
14044514243413 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 368640, while the sum is 40.
Adding to 14044514243413 its reverse (31434241544041), we get a palindrome (45478755787454).
The spelling of 14044514243413 in words is "fourteen trillion, forty-four billion, five hundred fourteen million, two hundred forty-three thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •