Base | Representation |
---|---|
bin | 110011110010010010… |
… | …101111100001001011 |
3 | 12022112011212201010210 |
4 | 303302102233201023 |
5 | 1402334234411201 |
6 | 41313331412203 |
7 | 4005635235000 |
oct | 636222574113 |
9 | 168464781123 |
10 | 55604607051 |
11 | 21644395304 |
12 | a939a54063 |
13 | 5321c4b166 |
14 | 2996c178a7 |
15 | 16a69291d6 |
hex | cf24af84b |
55604607051 has 16 divisors (see below), whose sum is σ = 86460032000. Its totient is φ = 31774060584.
The previous prime is 55604607041. The next prime is 55604607061. The reversal of 55604607051 is 15070640655.
It is an interprime number because it is at equal distance from previous prime (55604607041) and next prime (55604607061).
It is not a de Polignac number, because 55604607051 - 29 = 55604606539 is a prime.
It is a super-2 number, since 2×556046070512 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (55604607001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 27017731 + ... + 27019788.
It is an arithmetic number, because the mean of its divisors is an integer number (5403752000).
Almost surely, 255604607051 is an apocalyptic number.
55604607051 is a deficient number, since it is larger than the sum of its proper divisors (30855424949).
55604607051 is an equidigital number, since it uses as much as digits as its factorization.
55604607051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 54037543 (or 54037529 counting only the distinct ones).
The product of its (nonzero) digits is 126000, while the sum is 39.
The spelling of 55604607051 in words is "fifty-five billion, six hundred four million, six hundred seven thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •