Base | Representation |
---|---|
bin | 11000011111111… |
… | …011111011101000 |
3 | 1001122102020110220 |
4 | 120133323323220 |
5 | 1320210301003 |
6 | 104441410040 |
7 | 13120440663 |
oct | 3037737350 |
9 | 1048366426 |
10 | 411025128 |
11 | 1a1016298 |
12 | b5799920 |
13 | 67201947 |
14 | 3c8346da |
15 | 26140353 |
hex | 187fbee8 |
411025128 has 16 divisors (see below), whose sum is σ = 1027562880. Its totient is φ = 137008368.
The previous prime is 411025127. The next prime is 411025159. The reversal of 411025128 is 821520114.
It is a Harshad number since it is a multiple of its sum of digits (24), and also a Moran number because the ratio is a prime number: 17126047 = 411025128 / (4 + 1 + 1 + 0 + 2 + 5 + 1 + 2 + 8).
It is a junction number, because it is equal to n+sod(n) for n = 411025098 and 411025107.
It is not an unprimeable number, because it can be changed into a prime (411025127) 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 3 ways as a sum of consecutive naturals, for example, 8563000 + ... + 8563047.
It is an arithmetic number, because the mean of its divisors is an integer number (64222680).
Almost surely, 2411025128 is an apocalyptic number.
It is an amenable number.
411025128 is an abundant number, since it is smaller than the sum of its proper divisors (616537752).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
411025128 is a wasteful number, since it uses less digits than its factorization.
411025128 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17126056 (or 17126052 counting only the distinct ones).
The product of its (nonzero) digits is 640, while the sum is 24.
The square root of 411025128 is about 20273.7546596579. The cubic root of 411025128 is about 743.5145260444.
The spelling of 411025128 in words is "four hundred eleven million, twenty-five thousand, one hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •