Base | Representation |
---|---|
bin | 1110101101000010010… |
… | …00000110110010001110 |
3 | 1210022001021002012221112 |
4 | 13112201020012302032 |
5 | 31234134343232400 |
6 | 1024031534332022 |
7 | 51333453542240 |
oct | 7264110066216 |
9 | 1708037065845 |
10 | 505214430350 |
11 | 185295414173 |
12 | 81ab735a012 |
13 | 38845546c16 |
14 | 1a649982090 |
15 | d21d7e4835 |
hex | 75a1206c8e |
505214430350 has 24 divisors (see below), whose sum is σ = 1073941532688. Its totient is φ = 173216376000.
The previous prime is 505214430341. The next prime is 505214430367. The reversal of 505214430350 is 53034412505.
It is a happy number.
It is a super-2 number, since 2×5052144303502 (a number of 24 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
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 11 ways as a sum of consecutive naturals, for example, 721734551 + ... + 721735250.
It is an arithmetic number, because the mean of its divisors is an integer number (44747563862).
Almost surely, 2505214430350 is an apocalyptic number.
505214430350 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
505214430350 is an abundant number, since it is smaller than the sum of its proper divisors (568727102338).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
505214430350 is a wasteful number, since it uses less digits than its factorization.
505214430350 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1443469820 (or 1443469815 counting only the distinct ones).
The product of its (nonzero) digits is 36000, while the sum is 32.
Adding to 505214430350 its reverse (53034412505), we get a palindrome (558248842855).
The spelling of 505214430350 in words is "five hundred five billion, two hundred fourteen million, four hundred thirty thousand, three hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •