Base | Representation |
---|---|
bin | 1001110100101101… |
… | …10000000111000101 |
3 | 111121112222110200200 |
4 | 10322112300013011 |
5 | 41300121310203 |
6 | 2231200201113 |
7 | 244460226414 |
oct | 47226600705 |
9 | 14545873620 |
10 | 5274010053 |
11 | 226704a8a4 |
12 | 1032309199 |
13 | 660859a10 |
14 | 38062b47b |
15 | 20d02e9a3 |
hex | 13a5b01c5 |
5274010053 has 12 divisors (see below), whose sum is σ = 8204015820. Its totient is φ = 3245544576.
The previous prime is 5274010051. The next prime is 5274010073. The reversal of 5274010053 is 3500104725.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 454457124 + 4819552929 = 21318^2 + 69423^2 .
It is not a de Polignac number, because 5274010053 - 21 = 5274010051 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 5274009999 and 5274010026.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5274010051) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 22538388 + ... + 22538621.
It is an arithmetic number, because the mean of its divisors is an integer number (683667985).
Almost surely, 25274010053 is an apocalyptic number.
It is an amenable number.
5274010053 is a deficient number, since it is larger than the sum of its proper divisors (2930005767).
5274010053 is a wasteful number, since it uses less digits than its factorization.
5274010053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 45077028 (or 45077025 counting only the distinct ones).
The product of its (nonzero) digits is 4200, while the sum is 27.
The square root of 5274010053 is about 72622.3798356953. The cubic root of 5274010053 is about 1740.6588042359.
Adding to 5274010053 its reverse (3500104725), we get a palindrome (8774114778).
The spelling of 5274010053 in words is "five billion, two hundred seventy-four million, ten thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •