Base | Representation |
---|---|
bin | 1110101100101001010… |
… | …01011000100011000010 |
3 | 1210021111200002121011121 |
4 | 13112110221120203002 |
5 | 31233222243100200 |
6 | 1023555054502454 |
7 | 51325332046114 |
oct | 7262451304302 |
9 | 1707450077147 |
10 | 505005050050 |
11 | 1851982046a6 |
12 | 81a59204a2a |
13 | 38811057157 |
14 | 1a629c3b3b4 |
15 | d20a235e1a |
hex | 7594a588c2 |
505005050050 has 12 divisors (see below), whose sum is σ = 939309393186. Its totient is φ = 202002020000.
The previous prime is 505005050041. The next prime is 505005050057. The reversal of 505005050050 is 50050500505.
It can be written as a sum of positive squares in 3 ways, for example, as 437832332721 + 67172717329 = 661689^2 + 259177^2 .
It is a Harshad number since it is a multiple of its sum of digits (25).
It is a junction number, because it is equal to n+sod(n) for n = 505005049997 and 505005050024.
It is not an unprimeable number, because it can be changed into a prime (505005050057) by changing a digit.
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 5 ways as a sum of consecutive naturals, for example, 5050050451 + ... + 5050050550.
Almost surely, 2505005050050 is an apocalyptic number.
505005050050 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
505005050050 is a deficient number, since it is larger than the sum of its proper divisors (434304343136).
505005050050 is a wasteful number, since it uses less digits than its factorization.
505005050050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10100101013 (or 10100101008 counting only the distinct ones).
The product of its (nonzero) digits is 3125, while the sum is 25.
Adding to 505005050050 its reverse (50050500505), we get a palindrome (555055550555).
The spelling of 505005050050 in words is "five hundred five billion, five million, fifty thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •