Base | Representation |
---|---|
bin | 111001110001101011… |
… | …0101000011011010000 |
3 | 102212020220002001122110 |
4 | 1303203112220123100 |
5 | 4013100300220242 |
6 | 132555404305320 |
7 | 11651440611363 |
oct | 1634326503320 |
9 | 385226061573 |
10 | 124073445072 |
11 | 4868a252755 |
12 | 20067b42240 |
13 | b9140b26b5 |
14 | 60103380da |
15 | 33628d739c |
hex | 1ce35a86d0 |
124073445072 has 80 divisors (see below), whose sum is σ = 324562226688. Its totient is φ = 40837180800.
The previous prime is 124073445071. The next prime is 124073445103. The reversal of 124073445072 is 270544370421.
It is a self number, because there is not a number n which added to its sum of digits gives 124073445072.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (124073445071) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 8291197 + ... + 8306147.
Almost surely, 2124073445072 is an apocalyptic number.
124073445072 is a gapful number since it is divisible by the number (12) 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 124073445072, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (162281113344).
124073445072 is an abundant number, since it is smaller than the sum of its proper divisors (200488781616).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
124073445072 is a wasteful number, since it uses less digits than its factorization.
124073445072 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 17128 (or 17122 counting only the distinct ones).
The product of its (nonzero) digits is 188160, while the sum is 39.
The spelling of 124073445072 in words is "one hundred twenty-four billion, seventy-three million, four hundred forty-five thousand, seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •