Base | Representation |
---|---|
bin | 110011010110000010… |
… | …110101011101101001 |
3 | 12021022011002110122200 |
4 | 303112002311131221 |
5 | 1400401423100144 |
6 | 41154321410413 |
7 | 3661122002022 |
oct | 632602653551 |
9 | 167264073580 |
10 | 55130675049 |
11 | 2142091316a |
12 | a827199a09 |
13 | 52779c2418 |
14 | 294dcc9c49 |
15 | 167a00ec69 |
hex | cd60b5769 |
55130675049 has 12 divisors (see below), whose sum is σ = 79643439876. Its totient is φ = 36749056032.
The previous prime is 55130675029. The next prime is 55130675053. The reversal of 55130675049 is 94057603155.
55130675049 is a `hidden beast` number, since 5 + 5 + 130 + 6 + 7 + 504 + 9 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 26151741225 + 28978933824 = 161715^2 + 170232^2 .
It is not a de Polignac number, because 55130675049 - 28 = 55130674793 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 55130674995 and 55130675013.
It is not an unprimeable number, because it can be changed into a prime (55130675009) 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 11 ways as a sum of consecutive naturals, for example, 319342 + ... + 460695.
It is an arithmetic number, because the mean of its divisors is an integer number (6636953323).
Almost surely, 255130675049 is an apocalyptic number.
It is an amenable number.
55130675049 is a deficient number, since it is larger than the sum of its proper divisors (24512764827).
55130675049 is a wasteful number, since it uses less digits than its factorization.
55130675049 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 787896 (or 787893 counting only the distinct ones).
The product of its (nonzero) digits is 567000, while the sum is 45.
The spelling of 55130675049 in words is "fifty-five billion, one hundred thirty million, six hundred seventy-five thousand, forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •