Base | Representation |
---|---|
bin | 100110011101000010111… |
… | …1000101101011101000101 |
3 | 200201020122122021210211011 |
4 | 1030322011320231131011 |
5 | 1143042243314310203 |
6 | 15123530552042221 |
7 | 1053555420603631 |
oct | 114720570553505 |
9 | 20636578253734 |
10 | 5285056010053 |
11 | 175841a377a46 |
12 | 714342693371 |
13 | 2c44bcb57971 |
14 | 143b25cc3dc1 |
15 | 92722e8176d |
hex | 4ce85e2d745 |
5285056010053 has 8 divisors (see below), whose sum is σ = 5290007307480. Its totient is φ = 5280105192960.
The previous prime is 5285056010021. The next prime is 5285056010077. The reversal of 5285056010053 is 3500106505825.
It can be written as a sum of positive squares in 4 ways, for example, as 1251393483649 + 4033662526404 = 1118657^2 + 2008398^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 5285056010053 - 25 = 5285056010021 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5285056009988 and 5285056010015.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5285056010953) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 24188451 + ... + 24405967.
It is an arithmetic number, because the mean of its divisors is an integer number (661250913435).
Almost surely, 25285056010053 is an apocalyptic number.
It is an amenable number.
5285056010053 is a deficient number, since it is larger than the sum of its proper divisors (4951297427).
5285056010053 is a wasteful number, since it uses less digits than its factorization.
5285056010053 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 240167.
The product of its (nonzero) digits is 180000, while the sum is 40.
The spelling of 5285056010053 in words is "five trillion, two hundred eighty-five billion, fifty-six million, ten thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •