Base | Representation |
---|---|
bin | 111001100010100000100110… |
… | …1011100011011000101000001 |
3 | 2110101000121211010011022211020 |
4 | 1303011001031130123011001 |
5 | 1012314233230314112332 |
6 | 4552232233030140053 |
7 | 211414660333123146 |
oct | 16305011534330501 |
9 | 2411017733138736 |
10 | 506120245457217 |
11 | 1372a143303aa46 |
12 | 489215b21b1629 |
13 | 18953c1ba1c8b1 |
14 | 8cda4ca0083cd |
15 | 3d7a53817482c |
hex | 1cc504d71b141 |
506120245457217 has 32 divisors (see below), whose sum is σ = 710656769625600. Its totient is φ = 319514256588672.
The previous prime is 506120245457087. The next prime is 506120245457279. The reversal of 506120245457217 is 712754542021605.
It is not a de Polignac number, because 506120245457217 - 211 = 506120245455169 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 506120245457217.
It is not an unprimeable number, because it can be changed into a prime (506120245457287) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2016024733 + ... + 2016275765.
It is an arithmetic number, because the mean of its divisors is an integer number (22208024050800).
Almost surely, 2506120245457217 is an apocalyptic number.
506120245457217 is a gapful number since it is divisible by the number (57) formed by its first and last digit.
It is an amenable number.
506120245457217 is a deficient number, since it is larger than the sum of its proper divisors (204536524168383).
506120245457217 is a wasteful number, since it uses less digits than its factorization.
506120245457217 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 266477.
The product of its (nonzero) digits is 4704000, while the sum is 51.
The spelling of 506120245457217 in words is "five hundred six trillion, one hundred twenty billion, two hundred forty-five million, four hundred fifty-seven thousand, two hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •