Base | Representation |
---|---|
bin | 1111010111010… |
… | …11111101010101 |
3 | 22222112102121211 |
4 | 13223223331111 |
5 | 230444032012 |
6 | 20442341421 |
7 | 3123366430 |
oct | 753537525 |
9 | 288472554 |
10 | 128892757 |
11 | 66836044 |
12 | 371ba871 |
13 | 2091b806 |
14 | 13192817 |
15 | b4b06a7 |
hex | 7aebf55 |
128892757 has 8 divisors (see below), whose sum is σ = 149803200. Its totient is φ = 108606624.
The previous prime is 128892697. The next prime is 128892763. The reversal of 128892757 is 757298821.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 128892757 - 215 = 128859989 is a prime.
It is a super-2 number, since 2×1288927572 = 33226685614122098, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 128892757.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (128892787) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 155632 + ... + 156457.
It is an arithmetic number, because the mean of its divisors is an integer number (18725400).
Almost surely, 2128892757 is an apocalyptic number.
It is an amenable number.
128892757 is a deficient number, since it is larger than the sum of its proper divisors (20910443).
128892757 is an equidigital number, since it uses as much as digits as its factorization.
128892757 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 312155.
The product of its digits is 564480, while the sum is 49.
The square root of 128892757 is about 11353.0946001520. The cubic root of 128892757 is about 505.1373766047.
The spelling of 128892757 in words is "one hundred twenty-eight million, eight hundred ninety-two thousand, seven hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •