Base | Representation |
---|---|
bin | 11100100011110011011111… |
… | …101000011000101000100010 |
3 | 121110201210110110101112012111 |
4 | 130203303133220120220202 |
5 | 112430411112012310200 |
6 | 1123050255140545534 |
7 | 35312501131626133 |
oct | 3443633750305042 |
9 | 543653413345174 |
10 | 125605775510050 |
11 | 37027123815470 |
12 | 121072a80b22aa |
13 | 551175c866bb4 |
14 | 23034cdb4dc8a |
15 | e7c463c870ba |
hex | 723cdfa18a22 |
125605775510050 has 48 divisors (see below), whose sum is σ = 265946647557312. Its totient is φ = 43688965390400.
The previous prime is 125605775510011. The next prime is 125605775510069. The reversal of 125605775510050 is 50015577506521.
It is a junction number, because it is equal to n+sod(n) for n = 125605775509976 and 125605775510003.
It is an unprimeable number.
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, 4964642509 + ... + 4964667808.
It is an arithmetic number, because the mean of its divisors is an integer number (5540555157444).
Almost surely, 2125605775510050 is an apocalyptic number.
125605775510050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
125605775510050 is an abundant number, since it is smaller than the sum of its proper divisors (140340872047262).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
125605775510050 is a wasteful number, since it uses less digits than its factorization.
125605775510050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9929310363 (or 9929310358 counting only the distinct ones).
The product of its (nonzero) digits is 1837500, while the sum is 49.
The spelling of 125605775510050 in words is "one hundred twenty-five trillion, six hundred five billion, seven hundred seventy-five million, five hundred ten thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •