Base | Representation |
---|---|
bin | 11110001100000… |
… | …010101100101111 |
3 | 1022022000111201000 |
4 | 132030002230233 |
5 | 2014124121023 |
6 | 122131251343 |
7 | 15356644302 |
oct | 3614025457 |
9 | 1268014630 |
10 | 506473263 |
11 | 23a98894a |
12 | 121749b53 |
13 | 80c1062a |
14 | 4b39cb39 |
15 | 2e6e6243 |
hex | 1e302b2f |
506473263 has 8 divisors (see below), whose sum is σ = 750330800. Its totient is φ = 337648824.
The previous prime is 506473259. The next prime is 506473267. The reversal of 506473263 is 362374605.
506473263 is a `hidden beast` number, since 5 + 0 + 647 + 3 + 2 + 6 + 3 = 666.
It is an interprime number because it is at equal distance from previous prime (506473259) and next prime (506473267).
It is not a de Polignac number, because 506473263 - 22 = 506473259 is a prime.
It is a super-2 number, since 2×5064732632 = 513030332267734338, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (506473267) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 9379108 + ... + 9379161.
It is an arithmetic number, because the mean of its divisors is an integer number (93791350).
Almost surely, 2506473263 is an apocalyptic number.
506473263 is a deficient number, since it is larger than the sum of its proper divisors (243857537).
506473263 is a wasteful number, since it uses less digits than its factorization.
506473263 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18758278 (or 18758272 counting only the distinct ones).
The product of its (nonzero) digits is 90720, while the sum is 36.
The square root of 506473263 is about 22504.9608531097. The cubic root of 506473263 is about 797.1110713173. Note that the first 3 decimals are identical.
The spelling of 506473263 in words is "five hundred six million, four hundred seventy-three thousand, two hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •