Base | Representation |
---|---|
bin | 100111100111011100010… |
… | …0101010001101111001010 |
3 | 201021112000220001212102122 |
4 | 1033032320211101233022 |
5 | 1203201443002000004 |
6 | 15325152124131242 |
7 | 1101242503204241 |
oct | 117167045215712 |
9 | 21245026055378 |
10 | 5444820343754 |
11 | 180a154157570 |
12 | 73b2ab396b22 |
13 | 3065a133016c |
14 | 14b7603ad958 |
15 | 96973dbbcbe |
hex | 4f3b8951bca |
5444820343754 has 8 divisors (see below), whose sum is σ = 8909706017088. Its totient is φ = 2474918338060.
The previous prime is 5444820343751. The next prime is 5444820343757. The reversal of 5444820343754 is 4573430284445.
It is an interprime number because it is at equal distance from previous prime (5444820343751) and next prime (5444820343757).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 5444820343696 and 5444820343705.
It is not an unprimeable number, because it can be changed into a prime (5444820343751) 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 in 3 ways as a sum of consecutive naturals, for example, 123745916882 + ... + 123745916925.
It is an arithmetic number, because the mean of its divisors is an integer number (1113713252136).
Almost surely, 25444820343754 is an apocalyptic number.
5444820343754 is a deficient number, since it is larger than the sum of its proper divisors (3464885673334).
5444820343754 is a wasteful number, since it uses less digits than its factorization.
5444820343754 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 247491833820.
The product of its (nonzero) digits is 25804800, while the sum is 53.
The spelling of 5444820343754 in words is "five trillion, four hundred forty-four billion, eight hundred twenty million, three hundred forty-three thousand, seven hundred fifty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •