Base | Representation |
---|---|
bin | 111011100110001000… |
… | …1110001100101000000 |
3 | 110020100020022210022000 |
4 | 1313030101301211000 |
5 | 4044101200410133 |
6 | 134443242344000 |
7 | 12150331534143 |
oct | 1671421614500 |
9 | 406306283260 |
10 | 127981263168 |
11 | 4a3050a5290 |
12 | 209787bb000 |
13 | c0b7899cb5 |
14 | 62a133405a |
15 | 34e09ee413 |
hex | 1dcc471940 |
127981263168 has 448 divisors, whose sum is σ = 420916608000. Its totient is φ = 37804492800.
The previous prime is 127981263101. The next prime is 127981263173. The reversal of 127981263168 is 861362189721.
It is a Harshad number since it is a multiple of its sum of digits (54).
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, 155884198 + ... + 155885018.
It is an arithmetic number, because the mean of its divisors is an integer number (939546000).
Almost surely, 2127981263168 is an apocalyptic number.
127981263168 is a gapful number since it is divisible by the number (18) 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 127981263168, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (210458304000).
127981263168 is an abundant number, since it is smaller than the sum of its proper divisors (292935344832).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
127981263168 is a wasteful number, since it uses less digits than its factorization.
127981263168 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1051 (or 1035 counting only the distinct ones).
The product of its digits is 1741824, while the sum is 54.
The spelling of 127981263168 in words is "one hundred twenty-seven billion, nine hundred eighty-one million, two hundred sixty-three thousand, one hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.101 sec. • engine limits •