Base | Representation |
---|---|
bin | 11101110011000… |
… | …001011111010101 |
3 | 1021211200022001121 |
4 | 131303001133111 |
5 | 2010434232314 |
6 | 121334523541 |
7 | 15250130200 |
oct | 3563013725 |
9 | 1254608047 |
10 | 499914709 |
11 | 237209358 |
12 | 11b5065b1 |
13 | 7c755328 |
14 | 4a572937 |
15 | 2dd4cd24 |
hex | 1dcc17d5 |
499914709 has 12 divisors (see below), whose sum is σ = 592508844. Its totient is φ = 420411264.
The previous prime is 499914677. The next prime is 499914713. The reversal of 499914709 is 907419994.
It can be written as a sum of positive squares in 2 ways, for example, as 427579684 + 72335025 = 20678^2 + 8505^2 .
It is not a de Polignac number, because 499914709 - 25 = 499914677 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (499914739) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 93652 + ... + 98845.
It is an arithmetic number, because the mean of its divisors is an integer number (49375737).
Almost surely, 2499914709 is an apocalyptic number.
499914709 is a gapful number since it is divisible by the number (49) formed by its first and last digit.
It is an amenable number.
499914709 is a deficient number, since it is larger than the sum of its proper divisors (92594135).
499914709 is a wasteful number, since it uses less digits than its factorization.
499914709 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 192564 (or 192557 counting only the distinct ones).
The product of its (nonzero) digits is 734832, while the sum is 52.
The square root of 499914709 is about 22358.7725289203. The cubic root of 499914709 is about 793.6553930767.
The spelling of 499914709 in words is "four hundred ninety-nine million, nine hundred fourteen thousand, seven hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •