Base | Representation |
---|---|
bin | 1110101101000010000… |
… | …11001000001100111100 |
3 | 1210022001011121220221101 |
4 | 13112201003020030330 |
5 | 31234134030003221 |
6 | 1024031450342444 |
7 | 51333436465645 |
oct | 7264103101474 |
9 | 1708034556841 |
10 | 505213125436 |
11 | 185294702828 |
12 | 81ab6a2aa24 |
13 | 388451aac96 |
14 | 1a6497226cc |
15 | d21d637d91 |
hex | 75a10c833c |
505213125436 has 24 divisors (see below), whose sum is σ = 905960187440. Its totient is φ = 246383932032.
The previous prime is 505213125427. The next prime is 505213125437. The reversal of 505213125436 is 634521312505.
It is a super-2 number, since 2×5052131254362 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 505213125395 and 505213125404.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (505213125437) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1949481 + ... + 2193376.
Almost surely, 2505213125436 is an apocalyptic number.
It is an amenable number.
505213125436 is a deficient number, since it is larger than the sum of its proper divisors (400747062004).
505213125436 is a wasteful number, since it uses less digits than its factorization.
505213125436 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4143613 (or 4143611 counting only the distinct ones).
The product of its (nonzero) digits is 108000, while the sum is 37.
The spelling of 505213125436 in words is "five hundred five billion, two hundred thirteen million, one hundred twenty-five thousand, four hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •