Base | Representation |
---|---|
bin | 111011011101010100… |
… | …0101001010000000000 |
3 | 110012120121100200220210 |
4 | 1312322220221100000 |
5 | 4042444412042410 |
6 | 134354030234120 |
7 | 12140105605650 |
oct | 1667250512000 |
9 | 405517320823 |
10 | 127685268480 |
11 | 4a173007080 |
12 | 208b5655940 |
13 | c06b472303 |
14 | 6273cc4360 |
15 | 34c4a32220 |
hex | 1dbaa29400 |
127685268480 has 704 divisors, whose sum is σ = 520225431552. Its totient is φ = 25956188160.
The previous prime is 127685268467. The next prime is 127685268619. The reversal of 127685268480 is 84862586721.
It is a tau number, because it is divible by the number of its divisors (704).
It is a self number, because there is not a number n which added to its sum of digits gives 127685268480.
It is a congruent number.
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, 55586692 + ... + 55588988.
Almost surely, 2127685268480 is an apocalyptic number.
127685268480 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 127685268480, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (260112715776).
127685268480 is an abundant number, since it is smaller than the sum of its proper divisors (392540163072).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
127685268480 is a wasteful number, since it uses less digits than its factorization.
127685268480 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2390 (or 2372 counting only the distinct ones).
The product of its (nonzero) digits is 10321920, while the sum is 57.
The spelling of 127685268480 in words is "one hundred twenty-seven billion, six hundred eighty-five million, two hundred sixty-eight thousand, four hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •