Base | Representation |
---|---|
bin | 100111100100001100011… |
… | …0001101011011011011101 |
3 | 201020212000201100202012121 |
4 | 1033020120301223123131 |
5 | 1203043201113212421 |
6 | 15322040002502541 |
7 | 1100604564450160 |
oct | 117103061533335 |
9 | 21225021322177 |
10 | 5437844272861 |
11 | 18071a4367220 |
12 | 739a83064a51 |
13 | 305a2bc84b70 |
14 | 14b29bac1ad7 |
15 | 966b672cd41 |
hex | 4f218c6b6dd |
5437844272861 has 32 divisors (see below), whose sum is σ = 7438919378688. Its totient is φ = 3837537699840.
The previous prime is 5437844272843. The next prime is 5437844272871. The reversal of 5437844272861 is 1682724487345.
It is not a de Polignac number, because 5437844272861 - 27 = 5437844272733 is a prime.
It is a super-2 number, since 2×54378442728612 (a number of 26 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 5437844272861.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5437844272801) 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 31 ways as a sum of consecutive naturals, for example, 51196116 + ... + 51302221.
It is an arithmetic number, because the mean of its divisors is an integer number (232466230584).
Almost surely, 25437844272861 is an apocalyptic number.
It is an amenable number.
5437844272861 is a deficient number, since it is larger than the sum of its proper divisors (2001075105827).
5437844272861 is a wasteful number, since it uses less digits than its factorization.
5437844272861 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 102498421.
The product of its digits is 72253440, while the sum is 61.
The spelling of 5437844272861 in words is "five trillion, four hundred thirty-seven billion, eight hundred forty-four million, two hundred seventy-two thousand, eight hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •