Base | Representation |
---|---|
bin | 1110100101011000011… |
… | …01110011001100101000 |
3 | 1202220102220102012002112 |
4 | 13102230031303030220 |
5 | 31202231002130224 |
6 | 1022112114021452 |
7 | 51126601341233 |
oct | 7225415631450 |
9 | 1686386365075 |
10 | 501105505064 |
11 | 183576aa284a |
12 | 8114b277888 |
13 | 3833c1a8398 |
14 | 1a379d9641a |
15 | d07cc0530e |
hex | 74ac373328 |
501105505064 has 32 divisors (see below), whose sum is σ = 948404049600. Its totient is φ = 248205651840.
The previous prime is 501105505063. The next prime is 501105505097. The reversal of 501105505064 is 460505501105.
It is a super-2 number, since 2×5011055050642 (a number of 24 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 501105505064.
It is not an unprimeable number, because it can be changed into a prime (501105505063) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 15149 + ... + 1001219.
It is an arithmetic number, because the mean of its divisors is an integer number (29637626550).
Almost surely, 2501105505064 is an apocalyptic number.
It is an amenable number.
501105505064 is a deficient number, since it is larger than the sum of its proper divisors (447298544536).
501105505064 is a wasteful number, since it uses less digits than its factorization.
501105505064 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 986673 (or 986669 counting only the distinct ones).
The product of its (nonzero) digits is 15000, while the sum is 32.
The spelling of 501105505064 in words is "five hundred one billion, one hundred five million, five hundred five thousand, sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •