Base | Representation |
---|---|
bin | 1010010010000110… |
… | …01011010100010010 |
3 | 112020201212022212210 |
4 | 11021003023110102 |
5 | 42301224134400 |
6 | 2311444132550 |
7 | 253542534423 |
oct | 51103132422 |
9 | 15221768783 |
10 | 5520536850 |
11 | 2383221054 |
12 | 10a0997156 |
13 | 69c95456a |
14 | 3a528164a |
15 | 2249c9950 |
hex | 1490cb512 |
5520536850 has 48 divisors (see below), whose sum is σ = 13695694848. Its totient is φ = 1471631040.
The previous prime is 5520536821. The next prime is 5520536899. The reversal of 5520536850 is 586350255.
It is a super-2 number, since 2×55205368502 = 60952654224415845000, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 5520536799 and 5520536808.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 649327 + ... + 657773.
It is an arithmetic number, because the mean of its divisors is an integer number (285326976).
Almost surely, 25520536850 is an apocalyptic number.
5520536850 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
5520536850 is an abundant number, since it is smaller than the sum of its proper divisors (8175157998).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5520536850 is a wasteful number, since it uses less digits than its factorization.
5520536850 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12819 (or 12814 counting only the distinct ones).
The product of its (nonzero) digits is 180000, while the sum is 39.
The square root of 5520536850 is about 74300.3152752396. The cubic root of 5520536850 is about 1767.3684761627.
The spelling of 5520536850 in words is "five billion, five hundred twenty million, five hundred thirty-six thousand, eight hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •