Base | Representation |
---|---|
bin | 111010100100110101… |
… | …1111111000000110000 |
3 | 110000200112200021102101 |
4 | 1311021223333000300 |
5 | 4030104310144030 |
6 | 133442015030144 |
7 | 12042126031600 |
oct | 1651153770060 |
9 | 400615607371 |
10 | 125790318640 |
11 | 493903a0228 |
12 | 20466b0b354 |
13 | bb289b930c |
14 | 6134372c00 |
15 | 34134c07ca |
hex | 1d49aff030 |
125790318640 has 120 divisors (see below), whose sum is σ = 342809902512. Its totient is φ = 42798712320.
The previous prime is 125790318629. The next prime is 125790318677. The reversal of 125790318640 is 46813097521.
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 23 ways as a sum of consecutive naturals, for example, 391042 + ... + 635998.
It is a 1-persistent number, because it is pandigital, but 2⋅125790318640 = 251580637280 is not.
Almost surely, 2125790318640 is an apocalyptic number.
125790318640 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 125790318640, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (171404951256).
125790318640 is an abundant number, since it is smaller than the sum of its proper divisors (217019583872).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
125790318640 is a wasteful number, since it uses less digits than its factorization.
125790318640 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 245115 (or 245102 counting only the distinct ones).
The product of its (nonzero) digits is 362880, while the sum is 46.
The spelling of 125790318640 in words is "one hundred twenty-five billion, seven hundred ninety million, three hundred eighteen thousand, six hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •