Base | Representation |
---|---|
bin | 1111010010101… |
… | …01000101001010 |
3 | 22221101000220010 |
4 | 13221111011022 |
5 | 230314243022 |
6 | 20421212350 |
7 | 3115213620 |
oct | 751250512 |
9 | 287330803 |
10 | 128274762 |
11 | 66453800 |
12 | 36b610b6 |
13 | 20763435 |
14 | 13071510 |
15 | b3dc50c |
hex | 7a5514a |
128274762 has 96 divisors (see below), whose sum is σ = 330333696. Its totient is φ = 32487840.
The previous prime is 128274739. The next prime is 128274767. The reversal of 128274762 is 267472821.
It is a self number, because there is not a number n which added to its sum of digits gives 128274762.
It is not an unprimeable number, because it can be changed into a prime (128274767) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 218233 + ... + 218819.
It is an arithmetic number, because the mean of its divisors is an integer number (3440976).
Almost surely, 2128274762 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 128274762, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (165166848).
128274762 is an abundant number, since it is smaller than the sum of its proper divisors (202058934).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
128274762 is a wasteful number, since it uses less digits than its factorization.
128274762 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 664 (or 653 counting only the distinct ones).
The product of its digits is 75264, while the sum is 39.
The square root of 128274762 is about 11325.8448691477. The cubic root of 128274762 is about 504.3287647734.
The spelling of 128274762 in words is "one hundred twenty-eight million, two hundred seventy-four thousand, seven hundred sixty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •