Base | Representation |
---|---|
bin | 111011011100100110… |
… | …0100110110000000000 |
3 | 110012111220221220020010 |
4 | 1312321030212300000 |
5 | 4042422223002432 |
6 | 134351405144520 |
7 | 12136363536300 |
oct | 1667114466000 |
9 | 405456856203 |
10 | 127661140992 |
11 | 4a160427800 |
12 | 208a955b140 |
13 | c0664752a8 |
14 | 6270a03600 |
15 | 34c28683cc |
hex | 1db9326c00 |
127661140992 has 792 divisors, whose sum is σ = 447920413248. Its totient is φ = 32188907520.
The previous prime is 127661140979. The next prime is 127661141057. The reversal of 127661140992 is 299041166721.
It is a happy number.
127661140992 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is an unprimeable number.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 783197103 + ... + 783197265.
Almost surely, 2127661140992 is an apocalyptic number.
127661140992 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 127661140992, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (223960206624).
127661140992 is an abundant number, since it is smaller than the sum of its proper divisors (320259272256).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
127661140992 is a wasteful number, since it uses less digits than its factorization.
127661140992 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 265 (or 229 counting only the distinct ones).
The product of its (nonzero) digits is 326592, while the sum is 48.
The spelling of 127661140992 in words is "one hundred twenty-seven billion, six hundred sixty-one million, one hundred forty thousand, nine hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •