Base | Representation |
---|---|
bin | 1111001100101… |
… | …00100001100000 |
3 | 22212212221222111 |
4 | 13212110201200 |
5 | 230114023143 |
6 | 20352245104 |
7 | 3105420304 |
oct | 746244140 |
9 | 285787874 |
10 | 127486048 |
11 | 65a65178 |
12 | 36840794 |
13 | 20548441 |
14 | 12d07d04 |
15 | b2d399d |
hex | 7994860 |
127486048 has 48 divisors (see below), whose sum is σ = 265446720. Its totient is φ = 60103296.
The previous prime is 127486031. The next prime is 127486061. The reversal of 127486048 is 840684721.
It is a self number, because there is not a number n which added to its sum of digits gives 127486048.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 186315 + ... + 186997.
It is an arithmetic number, because the mean of its divisors is an integer number (5530140).
Almost surely, 2127486048 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 127486048, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (132723360).
127486048 is an abundant number, since it is smaller than the sum of its proper divisors (137960672).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
127486048 is a wasteful number, since it uses less digits than its factorization.
127486048 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1019 (or 1011 counting only the distinct ones).
The product of its (nonzero) digits is 86016, while the sum is 40.
The square root of 127486048 is about 11290.9719687899. The cubic root of 127486048 is about 503.2929954175.
The spelling of 127486048 in words is "one hundred twenty-seven million, four hundred eighty-six thousand, forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •