Base | Representation |
---|---|
bin | 110001011010010110… |
… | …011111010001000111 |
3 | 12001221112012020010022 |
4 | 301122112133101013 |
5 | 1332124143432411 |
6 | 40212350245355 |
7 | 3555522621515 |
oct | 613226372107 |
9 | 161845166108 |
10 | 53055452231 |
11 | 20556468591 |
12 | a3481b685b |
13 | 5006a9b222 |
14 | 27d444d4b5 |
15 | 15a7c3dedb |
hex | c5a59f447 |
53055452231 has 4 divisors (see below), whose sum is σ = 54766918464. Its totient is φ = 51343986000.
The previous prime is 53055452213. The next prime is 53055452243. The reversal of 53055452231 is 13225455035.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-53055452231 is a prime.
It is a super-2 number, since 2×530554522312 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 53055452191 and 53055452200.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (53055452531) 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 3 ways as a sum of consecutive naturals, for example, 855733070 + ... + 855733131.
It is an arithmetic number, because the mean of its divisors is an integer number (13691729616).
Almost surely, 253055452231 is an apocalyptic number.
53055452231 is a deficient number, since it is larger than the sum of its proper divisors (1711466233).
53055452231 is a wasteful number, since it uses less digits than its factorization.
53055452231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1711466232.
The product of its (nonzero) digits is 90000, while the sum is 35.
The spelling of 53055452231 in words is "fifty-three billion, fifty-five million, four hundred fifty-two thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •