Base | Representation |
---|---|
bin | 1110101100110111001… |
… | …01101110110001111010 |
3 | 1210021210210021112210210 |
4 | 13112123211232301322 |
5 | 31233442103024200 |
6 | 1024014415251550 |
7 | 51331245121521 |
oct | 7263345566172 |
9 | 1707723245723 |
10 | 505121533050 |
11 | 185247a34042 |
12 | 81a90219bb6 |
13 | 3882c21c2c4 |
14 | 1a63b4bd4b8 |
15 | d215594650 |
hex | 759b96ec7a |
505121533050 has 48 divisors (see below), whose sum is σ = 1253441962080. Its totient is φ = 134619445440.
The previous prime is 505121532989. The next prime is 505121533051. The reversal of 505121533050 is 50335121505.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 505121532999 and 505121533017.
It is not an unprimeable number, because it can be changed into a prime (505121533051) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 740580 + ... + 1248479.
It is an arithmetic number, because the mean of its divisors is an integer number (26113374210).
Almost surely, 2505121533050 is an apocalyptic number.
505121533050 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
505121533050 is an abundant number, since it is smaller than the sum of its proper divisors (748320429030).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
505121533050 is a wasteful number, since it uses less digits than its factorization.
505121533050 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1990767 (or 1990762 counting only the distinct ones).
The product of its (nonzero) digits is 11250, while the sum is 30.
Adding to 505121533050 its reverse (50335121505), we get a palindrome (555456654555).
The spelling of 505121533050 in words is "five hundred five billion, one hundred twenty-one million, five hundred thirty-three thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •