Base | Representation |
---|---|
bin | 11001001111011000101100… |
… | …10011000010001010011111 |
3 | 21021112011010200010021220222 |
4 | 30213230112103002022133 |
5 | 24233340134013021214 |
6 | 314014143315031555 |
7 | 14456022502344254 |
oct | 1447542623021237 |
9 | 237464120107828 |
10 | 55504236454559 |
11 | 1675a23a539062 |
12 | 628511459b5bb |
13 | 24c8047535849 |
14 | d9c5c2ab942b |
15 | 663bd4d9538e |
hex | 327b164c229f |
55504236454559 has 16 divisors (see below), whose sum is σ = 56149041499200. Its totient is φ = 54859906523136.
The previous prime is 55504236454507. The next prime is 55504236454613. The reversal of 55504236454559 is 95545463240555.
55504236454559 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 a de Polignac number, because none of the positive numbers 2k-55504236454559 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (55504236457559) 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 15 ways as a sum of consecutive naturals, for example, 4042839407 + ... + 4042853135.
It is an arithmetic number, because the mean of its divisors is an integer number (3509315093700).
Almost surely, 255504236454559 is an apocalyptic number.
55504236454559 is a deficient number, since it is larger than the sum of its proper divisors (644805044641).
55504236454559 is a wasteful number, since it uses less digits than its factorization.
55504236454559 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27634.
The product of its (nonzero) digits is 324000000, while the sum is 62.
The spelling of 55504236454559 in words is "fifty-five trillion, five hundred four billion, two hundred thirty-six million, four hundred fifty-four thousand, five hundred fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •