Base | Representation |
---|---|
bin | 1011011010010011… |
… | …1100111011010101 |
3 | 21220110211122012121 |
4 | 2312210330323111 |
5 | 22233130440203 |
6 | 1223541415541 |
7 | 135623155321 |
oct | 26644747325 |
9 | 7813748177 |
10 | 3063140053 |
11 | 1332076506 |
12 | 715a0a5b1 |
13 | 39a7c080c |
14 | 210b60981 |
15 | 12ddb70bd |
hex | b693ced5 |
3063140053 has 24 divisors (see below), whose sum is σ = 3415385736. Its totient is φ = 2735677440.
The previous prime is 3063140033. The next prime is 3063140083. The reversal of 3063140053 is 3500413603.
It can be written as a sum of positive squares in 12 ways, for example, as 1584199204 + 1478940849 = 39802^2 + 38457^2 .
It is not a de Polignac number, because 3063140053 - 25 = 3063140021 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 (3063140033) 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 23 ways as a sum of consecutive naturals, for example, 1055901 + ... + 1058797.
It is an arithmetic number, because the mean of its divisors is an integer number (142307739).
Almost surely, 23063140053 is an apocalyptic number.
It is an amenable number.
3063140053 is a deficient number, since it is larger than the sum of its proper divisors (352245683).
3063140053 is a wasteful number, since it uses less digits than its factorization.
3063140053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3033 (or 2992 counting only the distinct ones).
The product of its (nonzero) digits is 3240, while the sum is 25.
The square root of 3063140053 is about 55345.6416802624. The cubic root of 3063140053 is about 1452.2975945271.
Adding to 3063140053 its reverse (3500413603), we get a palindrome (6563553656).
The spelling of 3063140053 in words is "three billion, sixty-three million, one hundred forty thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •