Base | Representation |
---|---|
bin | 111010101001111111… |
… | …0111101100011000000 |
3 | 110001010120201201121120 |
4 | 1311103332331203000 |
5 | 4030433021044121 |
6 | 133511105352240 |
7 | 12046324251060 |
oct | 1652376754300 |
9 | 401116651546 |
10 | 125963065536 |
11 | 49469959560 |
12 | 204b4938680 |
13 | bb55720a09 |
14 | 614d29d3a0 |
15 | 3423744bc6 |
hex | 1d53fbd8c0 |
125963065536 has 448 divisors, whose sum is σ = 435400704000. Its totient is φ = 31181230080.
The previous prime is 125963065511. The next prime is 125963065561. The reversal of 125963065536 is 635560369521.
It is an interprime number because it is at equal distance from previous prime (125963065511) and next prime (125963065561).
It is a tau number, because it is divible by the number of its divisors (448).
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 33868285 + ... + 33872003.
Almost surely, 2125963065536 is an apocalyptic number.
125963065536 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 125963065536, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (217700352000).
125963065536 is an abundant number, since it is smaller than the sum of its proper divisors (309437638464).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
125963065536 is a wasteful number, since it uses less digits than its factorization.
125963065536 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3860 (or 3850 counting only the distinct ones).
The product of its (nonzero) digits is 4374000, while the sum is 51.
The spelling of 125963065536 in words is "one hundred twenty-five billion, nine hundred sixty-three million, sixty-five thousand, five hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •