Base | Representation |
---|---|
bin | 11110010111100… |
… | …010001010010001 |
3 | 1022111200120000020 |
4 | 132113202022101 |
5 | 2020412020323 |
6 | 122320014053 |
7 | 15424362042 |
oct | 3627421221 |
9 | 1274616006 |
10 | 509485713 |
11 | 241656180 |
12 | 122761329 |
13 | 81726849 |
14 | 4b9448c9 |
15 | 2eaddae3 |
hex | 1e5e2291 |
509485713 has 32 divisors (see below), whose sum is σ = 772706304. Its totient is φ = 295800000.
The previous prime is 509485693. The next prime is 509485723. The reversal of 509485713 is 317584905.
It is not a de Polignac number, because 509485713 - 25 = 509485681 is a prime.
It is a super-2 number, since 2×5094857132 = 519151383502236738, which contains 22 as substring.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (509485723) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 100858 + ... + 105788.
It is an arithmetic number, because the mean of its divisors is an integer number (24147072).
Almost surely, 2509485713 is an apocalyptic number.
It is an amenable number.
509485713 is a deficient number, since it is larger than the sum of its proper divisors (263220591).
509485713 is a wasteful number, since it uses less digits than its factorization.
509485713 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5077.
The product of its (nonzero) digits is 151200, while the sum is 42.
The square root of 509485713 is about 22571.7902037034. The cubic root of 509485713 is about 798.6883260856.
The spelling of 509485713 in words is "five hundred nine million, four hundred eighty-five thousand, seven hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •