Base | Representation |
---|---|
bin | 1110101100110101000… |
… | …00000011000010010100 |
3 | 1210021202111220111001011 |
4 | 13112122200003002110 |
5 | 31233422414002230 |
6 | 1024012523542004 |
7 | 51330633630610 |
oct | 7263240030224 |
9 | 1707674814034 |
10 | 505103265940 |
11 | 185238697759 |
12 | 81a8608a904 |
13 | 388284c4870 |
14 | 1a638cc6340 |
15 | d213b86e2a |
hex | 759a803094 |
505103265940 has 768 divisors, whose sum is σ = 1504056508416. Its totient is φ = 137952460800.
The previous prime is 505103265937. The next prime is 505103266027. The reversal of 505103265940 is 49562301505.
It is a junction number, because it is equal to n+sod(n) for n = 505103265893 and 505103265902.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 255 ways as a sum of consecutive naturals, for example, 1525991575 + ... + 1525991905.
It is an arithmetic number, because the mean of its divisors is an integer number (1958406912).
Almost surely, 2505103265940 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 505103265940, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (752028254208).
505103265940 is an abundant number, since it is smaller than the sum of its proper divisors (998953242476).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
505103265940 is a wasteful number, since it uses less digits than its factorization.
505103265940 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 488 (or 486 counting only the distinct ones).
The product of its (nonzero) digits is 162000, while the sum is 40.
The spelling of 505103265940 in words is "five hundred five billion, one hundred three million, two hundred sixty-five thousand, nine hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •