Base | Representation |
---|---|
bin | 111001000001101010001000… |
… | …1010010110000111001111101 |
3 | 2102210000222202121212100221112 |
4 | 1302003110101102300321331 |
5 | 1011221300000232223000 |
6 | 4534454132014411405 |
7 | 210440532046113212 |
oct | 16203242122607175 |
9 | 2383028677770845 |
10 | 501605225664125 |
11 | 135910644080040 |
12 | 48312553200b65 |
13 | 186b722911a17b |
14 | 8bc1b72b8bb09 |
15 | 3cecd82b62235 |
hex | 1c835114b0e7d |
501605225664125 has 128 divisors (see below), whose sum is σ = 699820391761920. Its totient is φ = 355825806336000.
The previous prime is 501605225664061. The next prime is 501605225664161. The reversal of 501605225664125 is 521466522506105.
It is not a de Polignac number, because 501605225664125 - 26 = 501605225664061 is a prime.
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 74766016271 + ... + 74766022979.
It is an arithmetic number, because the mean of its divisors is an integer number (5467346810640).
Almost surely, 2501605225664125 is an apocalyptic number.
501605225664125 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
It is an amenable number.
501605225664125 is a deficient number, since it is larger than the sum of its proper divisors (198215166097795).
501605225664125 is a wasteful number, since it uses less digits than its factorization.
501605225664125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10552 (or 10542 counting only the distinct ones).
The product of its (nonzero) digits is 4320000, while the sum is 50.
The spelling of 501605225664125 in words is "five hundred one trillion, six hundred five billion, two hundred twenty-five million, six hundred sixty-four thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •