Base | Representation |
---|---|
bin | 100101100010001001100… |
… | …0100010110011101111000 |
3 | 200021011012000010210101002 |
4 | 1023010103010112131320 |
5 | 1134004230330131300 |
6 | 14545452242344132 |
7 | 1041460212243536 |
oct | 113042304263570 |
9 | 20234160123332 |
10 | 5158575630200 |
11 | 17098155065a3 |
12 | 6b392465b048 |
13 | 2b55b41cc005 |
14 | 13b968043156 |
15 | 8e2be1035d5 |
hex | 4b113116778 |
5158575630200 has 24 divisors (see below), whose sum is σ = 11993688340680. Its totient is φ = 2063430252000.
The previous prime is 5158575630181. The next prime is 5158575630301. The reversal of 5158575630200 is 20365758515.
It is a happy number.
It is a super-2 number, since 2×51585756302002 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 12896438876 + ... + 12896439275.
It is an arithmetic number, because the mean of its divisors is an integer number (499737014195).
Almost surely, 25158575630200 is an apocalyptic number.
5158575630200 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
5158575630200 is an abundant number, since it is smaller than the sum of its proper divisors (6835112710480).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5158575630200 is a wasteful number, since it uses less digits than its factorization.
5158575630200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25792878167 (or 25792878158 counting only the distinct ones).
The product of its (nonzero) digits is 1260000, while the sum is 47.
The spelling of 5158575630200 in words is "five trillion, one hundred fifty-eight billion, five hundred seventy-five million, six hundred thirty thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •