Base | Representation |
---|---|
bin | 1111100110100100000… |
… | …11011001010010000010 |
3 | 1220020202201211021011021 |
4 | 13303102003121102002 |
5 | 32240413103100200 |
6 | 1050140404340054 |
7 | 53506026144565 |
oct | 7632203312202 |
9 | 1806681737137 |
10 | 536100050050 |
11 | 1973a4558404 |
12 | 87a969a462a |
13 | 3b72823c136 |
14 | 1bd398824dc |
15 | de2a05941a |
hex | 7cd20d9482 |
536100050050 has 24 divisors (see below), whose sum is σ = 997180005636. Its totient is φ = 214432727040.
The previous prime is 536100050039. The next prime is 536100050107. The reversal of 536100050050 is 50050001635.
It can be written as a sum of positive squares in 6 ways, for example, as 62655596721 + 473444453329 = 250311^2 + 688073^2 .
It is a super-2 number, since 2×5361000500502 (a number of 24 digits) contains 22 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 = 536100049997 and 536100050024.
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, 1446654 + ... + 1779046.
Almost surely, 2536100050050 is an apocalyptic number.
536100050050 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
536100050050 is a deficient number, since it is larger than the sum of its proper divisors (461079955586).
536100050050 is a wasteful number, since it uses less digits than its factorization.
536100050050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 364662 (or 364657 counting only the distinct ones).
The product of its (nonzero) digits is 2250, while the sum is 25.
Adding to 536100050050 its reverse (50050001635), we get a palindrome (586150051685).
The spelling of 536100050050 in words is "five hundred thirty-six billion, one hundred million, fifty thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •