Base | Representation |
---|---|
bin | 100101111000101000100… |
… | …0010010000110010011100 |
3 | 200102202211000112100202110 |
4 | 1023301101002100302130 |
5 | 1140302122114112200 |
6 | 15023555354154020 |
7 | 1045116561662466 |
oct | 113612102206234 |
9 | 20382730470673 |
10 | 5206859910300 |
11 | 1728242749914 |
12 | 70115aa22910 |
13 | 2ba00a67a259 |
14 | 140028959136 |
15 | 9069803bb50 |
hex | 4bc51090c9c |
5206859910300 has 72 divisors (see below), whose sum is σ = 15065446055296. Its totient is φ = 1388471578560.
The previous prime is 5206859910299. The next prime is 5206859910323. The reversal of 5206859910300 is 30199586025.
It is a happy number.
It is a super-2 number, since 2×52068599103002 (a number of 26 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 5206859910300.
It is a congruent number.
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 23 ways as a sum of consecutive naturals, for example, 22596267 + ... + 22825533.
Almost surely, 25206859910300 is an apocalyptic number.
5206859910300 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
5206859910300 is an abundant number, since it is smaller than the sum of its proper divisors (9858586144996).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5206859910300 is a wasteful number, since it uses less digits than its factorization.
5206859910300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 304987 (or 304980 counting only the distinct ones).
The product of its (nonzero) digits is 583200, while the sum is 48.
The spelling of 5206859910300 in words is "five trillion, two hundred six billion, eight hundred fifty-nine million, nine hundred ten thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •