Base | Representation |
---|---|
bin | 10110110000110011101010… |
… | …11111010110101011111101 |
3 | 20120020021001020212120101000 |
4 | 23120121311133112223331 |
5 | 23030102201111134440 |
6 | 254243104412040513 |
7 | 13354251310003224 |
oct | 1330316537265375 |
9 | 216207036776330 |
10 | 50055520021245 |
11 | 14a4947711a872 |
12 | 5745118463139 |
13 | 21c12a4c9665b |
14 | c509b30c3cbb |
15 | 5bc0d3e2b730 |
hex | 2d86757d6afd |
50055520021245 has 64 divisors (see below), whose sum is σ = 89524057593600. Its totient is φ = 26535468533760.
The previous prime is 50055520021217. The next prime is 50055520021249. The reversal of 50055520021245 is 54212002555005.
50055520021245 is a `hidden beast` number, since 5 + 0 + 0 + 5 + 5 + 520 + 0 + 2 + 124 + 5 = 666.
It is not a de Polignac number, because 50055520021245 - 222 = 50055515826941 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50055520021249) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 54666309 + ... + 55574421.
It is an arithmetic number, because the mean of its divisors is an integer number (1398813399900).
Almost surely, 250055520021245 is an apocalyptic number.
It is an amenable number.
50055520021245 is a deficient number, since it is larger than the sum of its proper divisors (39468537572355).
50055520021245 is a wasteful number, since it uses less digits than its factorization.
50055520021245 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 910587 (or 910581 counting only the distinct ones).
The product of its (nonzero) digits is 100000, while the sum is 36.
The spelling of 50055520021245 in words is "fifty trillion, fifty-five billion, five hundred twenty million, twenty-one thousand, two hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •