Base | Representation |
---|---|
bin | 10111111000110000001001… |
… | …01001011011101111111001 |
3 | 20212222120201202000010220201 |
4 | 23330120010221123233321 |
5 | 23341102334132004010 |
6 | 303414451354122201 |
7 | 14030663053066015 |
oct | 1374300451335771 |
9 | 225876652003821 |
10 | 52527528000505 |
11 | 15811888191608 |
12 | 5a8422aa20361 |
13 | 234042b2c28bc |
14 | cd84bb2c3545 |
15 | 61156535023a |
hex | 2fc604a5bbf9 |
52527528000505 has 8 divisors (see below), whose sum is σ = 66740859106632. Its totient is φ = 39550138729728.
The previous prime is 52527528000469. The next prime is 52527528000509. The reversal of 52527528000505 is 50500082572525.
It can be written as a sum of positive squares in 4 ways, for example, as 3352315650489 + 49175212350016 = 1830933^2 + 7012504^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 52527528000505 - 29 = 52527527999993 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (52527528000509) 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, 308985458742 + ... + 308985458911.
It is an arithmetic number, because the mean of its divisors is an integer number (8342607388329).
Almost surely, 252527528000505 is an apocalyptic number.
It is an amenable number.
52527528000505 is a deficient number, since it is larger than the sum of its proper divisors (14213331106127).
52527528000505 is a wasteful number, since it uses less digits than its factorization.
52527528000505 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 617970917675.
The product of its (nonzero) digits is 1400000, while the sum is 46.
The spelling of 52527528000505 in words is "fifty-two trillion, five hundred twenty-seven billion, five hundred twenty-eight million, five hundred five", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •