Base | Representation |
---|---|
bin | 1011010010100010… |
… | …0100111101110101 |
3 | 21211012111011221001 |
4 | 2310220210331311 |
5 | 22201304123203 |
6 | 1220414523301 |
7 | 135046063036 |
oct | 26450447565 |
9 | 7735434831 |
10 | 3030536053 |
11 | 1315727656 |
12 | 706b06531 |
13 | 393b164cc |
14 | 20a6b4a8d |
15 | 12b0c691d |
hex | b4a24f75 |
3030536053 has 4 divisors (see below), whose sum is σ = 3053670048. Its totient is φ = 3007402060.
The previous prime is 3030536029. The next prime is 3030536057. The reversal of 3030536053 is 3506350303.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 3030536053 - 25 = 3030536021 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3030536057) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 11566801 + ... + 11567062.
It is an arithmetic number, because the mean of its divisors is an integer number (763417512).
Almost surely, 23030536053 is an apocalyptic number.
It is an amenable number.
3030536053 is a deficient number, since it is larger than the sum of its proper divisors (23133995).
3030536053 is a wasteful number, since it uses less digits than its factorization.
3030536053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23133994.
The product of its (nonzero) digits is 12150, while the sum is 28.
The square root of 3030536053 is about 55050.3047493835. The cubic root of 3030536053 is about 1447.1264618015.
Adding to 3030536053 its reverse (3506350303), we get a palindrome (6536886356).
The spelling of 3030536053 in words is "three billion, thirty million, five hundred thirty-six thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •