Base | Representation |
---|---|
bin | 101000101111111100000… |
… | …1011010100110011011010 |
3 | 201211101212220021222111220 |
4 | 1101133320023110303122 |
5 | 1213224314030330200 |
6 | 15524500442232510 |
7 | 1115423522302113 |
oct | 121377013246332 |
9 | 21741786258456 |
10 | 5600506105050 |
11 | 186a18576729a |
12 | 7654ba1b5736 |
13 | 3181828335cc |
14 | 1550ccd3120a |
15 | 9aa36c114a0 |
hex | 517f82d4cda |
5600506105050 has 48 divisors (see below), whose sum is σ = 13891568016672. Its totient is φ = 1493219598400.
The previous prime is 5600506105043. The next prime is 5600506105057. The reversal of 5600506105050 is 505016050065.
It is an interprime number because it is at equal distance from previous prime (5600506105043) and next prime (5600506105057).
It is not an unprimeable number, because it can be changed into a prime (5600506105057) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 2204049 + ... + 4007348.
It is an arithmetic number, because the mean of its divisors is an integer number (289407667014).
Almost surely, 25600506105050 is an apocalyptic number.
5600506105050 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
5600506105050 is an abundant number, since it is smaller than the sum of its proper divisors (8291061911622).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5600506105050 is a wasteful number, since it uses less digits than its factorization.
5600506105050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6217423 (or 6217418 counting only the distinct ones).
The product of its (nonzero) digits is 22500, while the sum is 33.
The spelling of 5600506105050 in words is "five trillion, six hundred billion, five hundred six million, one hundred five thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •