Base | Representation |
---|---|
bin | 111010011001010000… |
… | …1010111110010111000 |
3 | 102222200110100101211011 |
4 | 1310302201113302320 |
5 | 4023310311114400 |
6 | 133335252443304 |
7 | 12026366346016 |
oct | 1646241276270 |
9 | 388613311734 |
10 | 125401660600 |
11 | 49200a71737 |
12 | 20378919534 |
13 | ba96319348 |
14 | 60d88c18b6 |
15 | 33de2ec8ba |
hex | 1d32857cb8 |
125401660600 has 96 divisors (see below), whose sum is σ = 309943666800. Its totient is φ = 47049984000.
The previous prime is 125401660537. The next prime is 125401660603. The reversal of 125401660600 is 6066104521.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (125401660603) by changing a digit.
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 23 ways as a sum of consecutive naturals, for example, 220432 + ... + 547168.
Almost surely, 2125401660600 is an apocalyptic number.
125401660600 is a gapful number since it is divisible by the number (10) 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 125401660600, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (154971833400).
125401660600 is an abundant number, since it is smaller than the sum of its proper divisors (184542006200).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
125401660600 is a wasteful number, since it uses less digits than its factorization.
125401660600 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 326873 (or 326864 counting only the distinct ones).
The product of its (nonzero) digits is 8640, while the sum is 31.
The spelling of 125401660600 in words is "one hundred twenty-five billion, four hundred one million, six hundred sixty thousand, six hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •