Base | Representation |
---|---|
bin | 1001010101010101100101… |
… | …01110010001010000100011 |
3 | 2200200002221101122212110000 |
4 | 10222222302232101100203 |
5 | 10142232333131322201 |
6 | 111352431321511043 |
7 | 4215556403220000 |
oct | 452526256212043 |
9 | 80602841585400 |
10 | 20524352214051 |
11 | 65a3368835374 |
12 | 2375910042483 |
13 | b5b5906aaa0a |
14 | 50d5537a28a7 |
15 | 258d4387ed86 |
hex | 12aab2b91423 |
20524352214051 has 200 divisors, whose sum is σ = 36619134284304. Its totient is φ = 11451165747840.
The previous prime is 20524352214019. The next prime is 20524352214137. The reversal of 20524352214051 is 15041225342502.
20524352214051 is a `hidden beast` number, since 2 + 0 + 5 + 2 + 43 + 522 + 1 + 40 + 51 = 666.
It is not a de Polignac number, because 20524352214051 - 25 = 20524352214019 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 20524352213997 and 20524352214015.
It is not an unprimeable number, because it can be changed into a prime (20524352214011) by changing a digit.
It is a polite number, since it can be written in 199 ways as a sum of consecutive naturals, for example, 2174876305 + ... + 2174885741.
Almost surely, 220524352214051 is an apocalyptic number.
20524352214051 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
20524352214051 is a deficient number, since it is larger than the sum of its proper divisors (16094782070253).
20524352214051 is an frugal number, since it uses more digits than its factorization.
20524352214051 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9741 (or 9711 counting only the distinct ones).
The product of its (nonzero) digits is 96000, while the sum is 36.
Adding to 20524352214051 its reverse (15041225342502), we get a palindrome (35565577556553).
The spelling of 20524352214051 in words is "twenty trillion, five hundred twenty-four billion, three hundred fifty-two million, two hundred fourteen thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •