Base | Representation |
---|---|
bin | 110011001111011110… |
… | …101011100101100001 |
3 | 12021000110211201200202 |
4 | 303033132223211201 |
5 | 1400140224042423 |
6 | 41135344554545 |
7 | 3655313552306 |
oct | 631736534541 |
9 | 167013751622 |
10 | 55020534113 |
11 | 213747256a6 |
12 | a7b6322a55 |
13 | 525ac3ab7c |
14 | 293d4190ad |
15 | 1670505728 |
hex | ccf7ab961 |
55020534113 has 4 divisors (see below), whose sum is σ = 56917793940. Its totient is φ = 53123274288.
The previous prime is 55020534061. The next prime is 55020534137. The reversal of 55020534113 is 31143502055.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 26034790609 + 28985743504 = 161353^2 + 170252^2 .
It is a cyclic number.
It is not a de Polignac number, because 55020534113 - 220 = 55019485537 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (29), and also a Moran number because the ratio is a prime number: 1897259797 = 55020534113 / (5 + 5 + 0 + 2 + 0 + 5 + 3 + 4 + 1 + 1 + 3).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (55020530113) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 948629870 + ... + 948629927.
It is an arithmetic number, because the mean of its divisors is an integer number (14229448485).
Almost surely, 255020534113 is an apocalyptic number.
It is an amenable number.
55020534113 is a deficient number, since it is larger than the sum of its proper divisors (1897259827).
55020534113 is a wasteful number, since it uses less digits than its factorization.
55020534113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1897259826.
The product of its (nonzero) digits is 9000, while the sum is 29.
The spelling of 55020534113 in words is "fifty-five billion, twenty million, five hundred thirty-four thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •