Base | Representation |
---|---|
bin | 11001011100000011100100… |
… | …01101111101110100100001 |
3 | 21100001202210211121100111021 |
4 | 30232001302031331310201 |
5 | 24313003220000424232 |
6 | 314550141150445441 |
7 | 14532333462245152 |
oct | 1456016215756441 |
9 | 240052724540437 |
10 | 55939570326817 |
11 | 16907925120681 |
12 | 6335568b03881 |
13 | 252a1042c4cb8 |
14 | db56bd857929 |
15 | 6701b37be397 |
hex | 32e07237dd21 |
55939570326817 has 32 divisors (see below), whose sum is σ = 62092913347584. Its totient is φ = 50159790950400.
The previous prime is 55939570326797. The next prime is 55939570326821. The reversal of 55939570326817 is 71862307593955.
55939570326817 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 55939570326817 - 211 = 55939570324769 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (55939570326847) 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, 19468938 + ... + 22156684.
It is an arithmetic number, because the mean of its divisors is an integer number (1940403542112).
Almost surely, 255939570326817 is an apocalyptic number.
It is an amenable number.
55939570326817 is a deficient number, since it is larger than the sum of its proper divisors (6153343020767).
55939570326817 is a wasteful number, since it uses less digits than its factorization.
55939570326817 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2688409.
The product of its (nonzero) digits is 428652000, while the sum is 70.
The spelling of 55939570326817 in words is "fifty-five trillion, nine hundred thirty-nine billion, five hundred seventy million, three hundred twenty-six thousand, eight hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •