Base | Representation |
---|---|
bin | 10111010011010110110010… |
… | …00101111011001011000101 |
3 | 20201102202010001010202112002 |
4 | 23221223121011323023011 |
5 | 23204024322111101440 |
6 | 300552305411435045 |
7 | 13536104306525234 |
oct | 1351533105731305 |
9 | 221382101122462 |
10 | 51242602050245 |
11 | 15366957a69071 |
12 | 58b71ab8b5a85 |
13 | 22792061a0428 |
14 | c92225b16b1b |
15 | 5dce0e9ba115 |
hex | 2e9ad917b2c5 |
51242602050245 has 4 divisors (see below), whose sum is σ = 61491122460300. Its totient is φ = 40994081640192.
The previous prime is 51242602050209. The next prime is 51242602050329. The reversal of 51242602050245 is 54205020624215.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 11109895588801 + 40132706461444 = 3333151^2 + 6335038^2 .
It is a cyclic number.
It is not a de Polignac number, because 51242602050245 - 26 = 51242602050181 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 51242602050199 and 51242602050208.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5124260205020 + ... + 5124260205029.
It is an arithmetic number, because the mean of its divisors is an integer number (15372780615075).
Almost surely, 251242602050245 is an apocalyptic number.
It is an amenable number.
51242602050245 is a deficient number, since it is larger than the sum of its proper divisors (10248520410055).
51242602050245 is a wasteful number, since it uses less digits than its factorization.
51242602050245 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10248520410054.
The product of its (nonzero) digits is 192000, while the sum is 38.
The spelling of 51242602050245 in words is "fifty-one trillion, two hundred forty-two billion, six hundred two million, fifty thousand, two hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •