Base | Representation |
---|---|
bin | 100100100100100111000… |
… | …0010011100011101110010 |
3 | 122210112001220212222211121 |
4 | 1021021032002130131302 |
5 | 1124323102234000200 |
6 | 14405034514132454 |
7 | 1026101253361612 |
oct | 111111602343562 |
9 | 18715056788747 |
10 | 5026421000050 |
11 | 166876968599a |
12 | 6921a228112a |
13 | 2a5cb2b1c8c8 |
14 | 1353cc74aa42 |
15 | 8ab37035e1a |
hex | 4924e09c772 |
5026421000050 has 24 divisors (see below), whose sum is σ = 9454189619700. Its totient is φ = 1987977742080.
The previous prime is 5026421000023. The next prime is 5026421000147. The reversal of 5026421000050 is 500001246205.
It can be written as a sum of positive squares in 6 ways, for example, as 2807658818449 + 2218762181601 = 1675607^2 + 1489551^2 .
It is a Harshad number since it is a multiple of its sum of digits (25).
It is a junction number, because it is equal to n+sod(n) for n = 5026420999979 and 5026421000024.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 564761955 + ... + 564770854.
Almost surely, 25026421000050 is an apocalyptic number.
5026421000050 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
5026421000050 is a deficient number, since it is larger than the sum of its proper divisors (4427768619650).
5026421000050 is a wasteful number, since it uses less digits than its factorization.
5026421000050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1129532910 (or 1129532905 counting only the distinct ones).
The product of its (nonzero) digits is 2400, while the sum is 25.
Adding to 5026421000050 its reverse (500001246205), we get a palindrome (5526422246255).
The spelling of 5026421000050 in words is "five trillion, twenty-six billion, four hundred twenty-one million, fifty", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •