Base | Representation |
---|---|
bin | 1110101100101111111… |
… | …01001001001011110010 |
3 | 1210021122112112212202210 |
4 | 13112113331021023302 |
5 | 31233331000433100 |
6 | 1024004400352550 |
7 | 51326604640401 |
oct | 7262775111362 |
9 | 1707575485683 |
10 | 505060561650 |
11 | 18521657a357 |
12 | 81a73915756 |
13 | 3881c6c2158 |
14 | 1a63336b638 |
15 | d21004dc50 |
hex | 7597f492f2 |
505060561650 has 48 divisors (see below), whose sum is σ = 1286402914944. Its totient is φ = 131042738880.
The previous prime is 505060561609. The next prime is 505060561667. The reversal of 505060561650 is 56165060505.
It is a junction number, because it is equal to n+sod(n) for n = 505060561599 and 505060561608.
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 23 ways as a sum of consecutive naturals, for example, 45495402 + ... + 45506501.
It is an arithmetic number, because the mean of its divisors is an integer number (26800060728).
Almost surely, 2505060561650 is an apocalyptic number.
505060561650 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
505060561650 is an abundant number, since it is smaller than the sum of its proper divisors (781342353294).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
505060561650 is a wasteful number, since it uses less digits than its factorization.
505060561650 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 91001955 (or 91001950 counting only the distinct ones).
The product of its (nonzero) digits is 135000, while the sum is 39.
The spelling of 505060561650 in words is "five hundred five billion, sixty million, five hundred sixty-one thousand, six hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •