Base | Representation |
---|---|
bin | 1110101101101010010… |
… | …10000111000011010100 |
3 | 1210022220200110022220112 |
4 | 13112311022013003110 |
5 | 31240331412000202 |
6 | 1024125141422152 |
7 | 51345004230263 |
oct | 7266512070324 |
9 | 1708820408815 |
10 | 505550500052 |
11 | 185448094324 |
12 | 81b8ba0a958 |
13 | 3889a063630 |
14 | 1a67c4645da |
15 | d23d07ab52 |
hex | 75b52870d4 |
505550500052 has 24 divisors (see below), whose sum is σ = 994192958976. Its totient is φ = 223186173408.
The previous prime is 505550500051. The next prime is 505550500061. The reversal of 505550500052 is 250005055505.
It is a junction number, because it is equal to n+sod(n) for n = 505550499991 and 505550500018.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (505550500051) 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, 211349348 + ... + 211351739.
It is an arithmetic number, because the mean of its divisors is an integer number (41424706624).
Almost surely, 2505550500052 is an apocalyptic number.
505550500052 is a gapful number since it is divisible by the number (52) formed by its first and last digit.
It is an amenable number.
505550500052 is a deficient number, since it is larger than the sum of its proper divisors (488642458924).
505550500052 is a wasteful number, since it uses less digits than its factorization.
505550500052 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 422701127 (or 422701125 counting only the distinct ones).
The product of its (nonzero) digits is 31250, while the sum is 32.
Adding to 505550500052 its reverse (250005055505), we get a palindrome (755555555557).
The spelling of 505550500052 in words is "five hundred five billion, five hundred fifty million, five hundred thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •