Base | Representation |
---|---|
bin | 1100110001011111111111… |
… | …1101001001110011011011 |
3 | 1211201122102022010211102120 |
4 | 3030113333331021303123 |
5 | 3320101210312433033 |
6 | 45511550151232323 |
7 | 2646453564635334 |
oct | 314277775116333 |
9 | 54648368124376 |
10 | 14044542311643 |
11 | 4525290aa3698 |
12 | 16a9b149786a3 |
13 | 7ab5190a5a7c |
14 | 367a8bddb28b |
15 | 1954e65801b3 |
hex | cc5fff49cdb |
14044542311643 has 48 divisors (see below), whose sum is σ = 19328621276160. Its totient is φ = 9064495361664.
The previous prime is 14044542311641. The next prime is 14044542311669. The reversal of 14044542311643 is 34611324544041.
It is not a de Polignac number, because 14044542311643 - 21 = 14044542311641 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 14044542311595 and 14044542311604.
It is not an unprimeable number, because it can be changed into a prime (14044542311641) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 9626142048 + ... + 9626143506.
It is an arithmetic number, because the mean of its divisors is an integer number (402679609920).
Almost surely, 214044542311643 is an apocalyptic number.
14044542311643 is a deficient number, since it is larger than the sum of its proper divisors (5284078964517).
14044542311643 is an equidigital number, since it uses as much as digits as its factorization.
14044542311643 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2996 (or 2679 counting only the distinct ones).
The product of its (nonzero) digits is 552960, while the sum is 42.
Adding to 14044542311643 its reverse (34611324544041), we get a palindrome (48655866855684).
The spelling of 14044542311643 in words is "fourteen trillion, forty-four billion, five hundred forty-two million, three hundred eleven thousand, six hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •