Base | Representation |
---|---|
bin | 1111010111110… |
… | …00010100000001 |
3 | 22222122000001001 |
4 | 13223320110001 |
5 | 231002141421 |
6 | 20443412001 |
7 | 3124000111 |
oct | 753702401 |
9 | 288560031 |
10 | 128943361 |
11 | 66870068 |
12 | 37224001 |
13 | 20938861 |
14 | 131a7041 |
15 | b4c0691 |
hex | 7af8501 |
128943361 has 4 divisors (see below), whose sum is σ = 130272772. Its totient is φ = 127613952.
The previous prime is 128943349. The next prime is 128943383. The reversal of 128943361 is 163349821.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 103632400 + 25310961 = 10180^2 + 5031^2 .
It is a cyclic number.
It is not a de Polignac number, because 128943361 - 219 = 128419073 is a prime.
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 128943361.
It is not an unprimeable number, because it can be changed into a prime (128943391) 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 3 ways as a sum of consecutive naturals, for example, 664560 + ... + 664753.
It is an arithmetic number, because the mean of its divisors is an integer number (32568193).
Almost surely, 2128943361 is an apocalyptic number.
It is an amenable number.
128943361 is a deficient number, since it is larger than the sum of its proper divisors (1329411).
128943361 is an equidigital number, since it uses as much as digits as its factorization.
128943361 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1329410.
The product of its digits is 31104, while the sum is 37.
The square root of 128943361 is about 11355.3230249077. The cubic root of 128943361 is about 505.2034745191.
The spelling of 128943361 in words is "one hundred twenty-eight million, nine hundred forty-three thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •