Base | Representation |
---|---|
bin | 1111010100010… |
… | …01110111001001 |
3 | 22221210000110012 |
4 | 13222021313021 |
5 | 230343202303 |
6 | 20430001305 |
7 | 3120104123 |
oct | 752116711 |
9 | 287700405 |
10 | 128490953 |
11 | 66591178 |
12 | 37046235 |
13 | 2080a966 |
14 | 130ca213 |
15 | b4315d8 |
hex | 7a89dc9 |
128490953 has 4 divisors (see below), whose sum is σ = 129815700. Its totient is φ = 127166208.
The previous prime is 128490911. The next prime is 128490983. The reversal of 128490953 is 359094821.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 359094821 = 2099 ⋅171079.
It can be written as a sum of positive squares in 2 ways, for example, as 54582544 + 73908409 = 7388^2 + 8597^2 .
It is a cyclic number.
It is not a de Polignac number, because 128490953 - 28 = 128490697 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 128490953.
It is not an unprimeable number, because it can be changed into a prime (128490983) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 662228 + ... + 662421.
It is an arithmetic number, because the mean of its divisors is an integer number (32453925).
Almost surely, 2128490953 is an apocalyptic number.
It is an amenable number.
128490953 is a deficient number, since it is larger than the sum of its proper divisors (1324747).
128490953 is an equidigital number, since it uses as much as digits as its factorization.
128490953 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1324746.
The product of its (nonzero) digits is 77760, while the sum is 41.
The square root of 128490953 is about 11335.3849956673. The cubic root of 128490953 is about 504.6119333476.
The spelling of 128490953 in words is "one hundred twenty-eight million, four hundred ninety thousand, nine hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •