Base | Representation |
---|---|
bin | 110011010001010110… |
… | …101101110100010011 |
3 | 12021002200001101111122 |
4 | 303101112231310103 |
5 | 1400221303004111 |
6 | 41142431232455 |
7 | 3656145166163 |
oct | 632126556423 |
9 | 167080041448 |
10 | 55052000531 |
11 | 21390467900 |
12 | a80497872b |
13 | 5264607458 |
14 | 294368a5a3 |
15 | 167316dcdb |
hex | cd15add13 |
55052000531 has 6 divisors (see below), whose sum is σ = 60511703196. Its totient is φ = 50047273100.
The previous prime is 55052000527. The next prime is 55052000533. The reversal of 55052000531 is 13500025055.
It is not a de Polignac number, because 55052000531 - 22 = 55052000527 is a prime.
It is a super-2 number, since 2×550520005312 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 55052000531.
It is not an unprimeable number, because it can be changed into a prime (55052000533) 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 5 ways as a sum of consecutive naturals, for example, 227487485 + ... + 227487726.
It is an arithmetic number, because the mean of its divisors is an integer number (10085283866).
Almost surely, 255052000531 is an apocalyptic number.
55052000531 is a deficient number, since it is larger than the sum of its proper divisors (5459702665).
55052000531 is a wasteful number, since it uses less digits than its factorization.
55052000531 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 454975233 (or 454975222 counting only the distinct ones).
The product of its (nonzero) digits is 3750, while the sum is 26.
Adding to 55052000531 its reverse (13500025055), we get a palindrome (68552025586).
The spelling of 55052000531 in words is "fifty-five billion, fifty-two million, five hundred thirty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •