Base | Representation |
---|---|
bin | 11101110100111… |
… | …100000010000001 |
3 | 1021212121210120200 |
4 | 131310330002001 |
5 | 2011101313031 |
6 | 121353355413 |
7 | 15254320434 |
oct | 3564740201 |
9 | 1255553520 |
10 | 500416641 |
11 | 23752147a |
12 | 11b708b69 |
13 | 7c89c92a |
14 | 4a66381b |
15 | 2ddeb8e6 |
hex | 1dd3c081 |
500416641 has 12 divisors (see below), whose sum is σ = 765343332. Its totient is φ = 313986816.
The previous prime is 500416633. The next prime is 500416643. The reversal of 500416641 is 146614005.
500416641 is a `hidden beast` number, since 5 + 0 + 0 + 4 + 16 + 641 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 356416641 + 144000000 = 18879^2 + 12000^2 .
It is not a de Polignac number, because 500416641 - 23 = 500416633 is a prime.
It is not an unprimeable number, because it can be changed into a prime (500416643) 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 11 ways as a sum of consecutive naturals, for example, 1635196 + ... + 1635501.
It is an arithmetic number, because the mean of its divisors is an integer number (63778611).
Almost surely, 2500416641 is an apocalyptic number.
500416641 is a gapful number since it is divisible by the number (51) formed by its first and last digit.
It is an amenable number.
500416641 is a deficient number, since it is larger than the sum of its proper divisors (264926691).
500416641 is a wasteful number, since it uses less digits than its factorization.
500416641 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3270720 (or 3270717 counting only the distinct ones).
The product of its (nonzero) digits is 2880, while the sum is 27.
The square root of 500416641 is about 22369.9942109961. The cubic root of 500416641 is about 793.9209235649.
The spelling of 500416641 in words is "five hundred million, four hundred sixteen thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •