Base | Representation |
---|---|
bin | 1110100011011001110… |
… | …00010010001001010010 |
3 | 1202210200211221021001021 |
4 | 13101230320102021102 |
5 | 31143041440300200 |
6 | 1021414434430054 |
7 | 51061346343361 |
oct | 7215470221122 |
9 | 1683624837037 |
10 | 500042900050 |
11 | 1830811a9991 |
12 | 80ab343232a |
13 | 381cccbb615 |
14 | 1a2b8bcd7d8 |
15 | d0197a941a |
hex | 746ce12252 |
500042900050 has 24 divisors (see below), whose sum is σ = 934141299300. Its totient is φ = 199143718080.
The previous prime is 500042900041. The next prime is 500042900053. The reversal of 500042900050 is 50009240005.
It can be written as a sum of positive squares in 6 ways, for example, as 203598585961 + 296444314089 = 451219^2 + 544467^2 .
It is a super-3 number, since 3×5000429000503 (a number of 36 digits) contains 333 as substring.
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 = 500042899988 and 500042900024.
It is not an unprimeable number, because it can be changed into a prime (500042900053) 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 11 ways as a sum of consecutive naturals, for example, 21824485 + ... + 21847384.
Almost surely, 2500042900050 is an apocalyptic number.
500042900050 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
500042900050 is a deficient number, since it is larger than the sum of its proper divisors (434098399250).
500042900050 is a wasteful number, since it uses less digits than its factorization.
500042900050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43672110 (or 43672105 counting only the distinct ones).
The product of its (nonzero) digits is 1800, while the sum is 25.
The spelling of 500042900050 in words is "five hundred billion, forty-two million, nine hundred thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •