Base | Representation |
---|---|
bin | 1110101110100011001… |
… | …01111010111111010000 |
3 | 1210101010221010010010212 |
4 | 13113101211322333100 |
5 | 31242321023141340 |
6 | 1024244342343252 |
7 | 51362556141344 |
oct | 7272145727720 |
9 | 1711127103125 |
10 | 506027552720 |
11 | 1856723a8028 |
12 | 820a372ab28 |
13 | 38944b42911 |
14 | 1a6c5965624 |
15 | d269daea65 |
hex | 75d197afd0 |
506027552720 has 40 divisors (see below), whose sum is σ = 1178688863400. Its totient is φ = 202036861440.
The previous prime is 506027552707. The next prime is 506027552743. The reversal of 506027552720 is 27255720605.
It can be written as a sum of positive squares in 4 ways, for example, as 104391025216 + 401636527504 = 323096^2 + 633748^2 .
It is a tau number, because it is divible by the number of its divisors (40).
It is a super-2 number, since 2×5060275527202 (a number of 24 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5802695 + ... + 5889254.
It is an arithmetic number, because the mean of its divisors is an integer number (29467221585).
Almost surely, 2506027552720 is an apocalyptic number.
It is an amenable number.
506027552720 is an abundant number, since it is smaller than the sum of its proper divisors (672661310680).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
506027552720 is a wasteful number, since it uses less digits than its factorization.
506027552720 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11692503 (or 11692497 counting only the distinct ones).
The product of its (nonzero) digits is 294000, while the sum is 41.
The spelling of 506027552720 in words is "five hundred six billion, twenty-seven million, five hundred fifty-two thousand, seven hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •